./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrlen_unsafe.i --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/array-memsafety/cstrlen_unsafe.i -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 1fa4bda6bd30ba2cdf5e016e12b6593fa4b1ef45b4dc13eb01e28da7c534ab67 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:26:20,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:26:20,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:26:20,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:26:20,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:26:20,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:26:20,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:26:20,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:26:20,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:26:20,515 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:26:20,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:26:20,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:26:20,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:26:20,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:26:20,517 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:26:20,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:26:20,517 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:26:20,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:26:20,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:26:20,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:26:20,517 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:26:20,517 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:26:20,518 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:26:20,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:26:20,518 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:26:20,518 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:26:20,518 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:26:20,518 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:26:20,518 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:26:20,518 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:26:20,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:26:20,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:26:20,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:26:20,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:26:20,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:26:20,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:26:20,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:26:20,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:26:20,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:26:20,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:26:20,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:26:20,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:26:20,519 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 -> 1fa4bda6bd30ba2cdf5e016e12b6593fa4b1ef45b4dc13eb01e28da7c534ab67 [2025-03-04 07:26:20,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:26:20,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:26:20,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:26:20,812 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:26:20,812 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:26:20,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrlen_unsafe.i [2025-03-04 07:26:21,950 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf4291143/aafbc391bc054fc3b0fbdb59255de8f3/FLAG69411feca [2025-03-04 07:26:22,279 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:26:22,279 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrlen_unsafe.i [2025-03-04 07:26:22,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf4291143/aafbc391bc054fc3b0fbdb59255de8f3/FLAG69411feca [2025-03-04 07:26:22,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf4291143/aafbc391bc054fc3b0fbdb59255de8f3 [2025-03-04 07:26:22,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:26:22,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:26:22,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:26:22,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:26:22,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:26:22,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:26:22" (1/1) ... [2025-03-04 07:26:22,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7937a601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:22, skipping insertion in model container [2025-03-04 07:26:22,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:26:22" (1/1) ... [2025-03-04 07:26:22,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:26:22,527 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:26:22,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:26:22,551 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:26:22,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:26:22,604 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:26:22,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:22 WrapperNode [2025-03-04 07:26:22,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:26:22,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:26:22,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:26:22,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:26:22,610 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:26:22" (1/1) ... [2025-03-04 07:26:22,621 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:26:22" (1/1) ... [2025-03-04 07:26:22,633 INFO L138 Inliner]: procedures = 118, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 50 [2025-03-04 07:26:22,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:26:22,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:26:22,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:26:22,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:26:22,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:22" (1/1) ... [2025-03-04 07:26:22,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:22" (1/1) ... [2025-03-04 07:26:22,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:22" (1/1) ... [2025-03-04 07:26:22,654 INFO L175 MemorySlicer]: Split 3 memory accesses to 1 slices as follows [3]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-03-04 07:26:22,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:22" (1/1) ... [2025-03-04 07:26:22,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:22" (1/1) ... [2025-03-04 07:26:22,660 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:22" (1/1) ... [2025-03-04 07:26:22,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:22" (1/1) ... [2025-03-04 07:26:22,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:22" (1/1) ... [2025-03-04 07:26:22,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:22" (1/1) ... [2025-03-04 07:26:22,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:26:22,663 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:26:22,663 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:26:22,663 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:26:22,664 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:22" (1/1) ... [2025-03-04 07:26:22,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:26:22,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:22,691 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:26:22,693 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:26:22,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:26:22,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:26:22,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:26:22,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:26:22,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:26:22,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:26:22,789 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:26:22,791 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:26:22,937 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-04 07:26:22,937 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:26:22,944 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:26:22,945 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:26:22,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:26:22 BoogieIcfgContainer [2025-03-04 07:26:22,946 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:26:22,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:26:22,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:26:22,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:26:22,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:26:22" (1/3) ... [2025-03-04 07:26:22,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220ea4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:26:22, skipping insertion in model container [2025-03-04 07:26:22,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:26:22" (2/3) ... [2025-03-04 07:26:22,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220ea4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:26:22, skipping insertion in model container [2025-03-04 07:26:22,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:26:22" (3/3) ... [2025-03-04 07:26:22,955 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrlen_unsafe.i [2025-03-04 07:26:22,967 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:26:22,969 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrlen_unsafe.i that has 1 procedures, 30 locations, 1 initial locations, 2 loop locations, and 10 error locations. [2025-03-04 07:26:22,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:26:23,002 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;@25eb01fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:26:23,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-04 07:26:23,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.736842105263158) internal successors, (33), 29 states have internal predecessors, (33), 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:26:23,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:26:23,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:23,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:26:23,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2025-03-04 07:26:23,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:23,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1951491037, now seen corresponding path program 1 times [2025-03-04 07:26:23,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:23,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649583189] [2025-03-04 07:26:23,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:23,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:23,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:26:23,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:26:23,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:23,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:23,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:23,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649583189] [2025-03-04 07:26:23,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649583189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:23,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:23,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:26:23,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678331892] [2025-03-04 07:26:23,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:23,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:26:23,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:23,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:26:23,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:26:23,210 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.736842105263158) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:23,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:23,244 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2025-03-04 07:26:23,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:26:23,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:26:23,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:23,251 INFO L225 Difference]: With dead ends: 28 [2025-03-04 07:26:23,251 INFO L226 Difference]: Without dead ends: 26 [2025-03-04 07:26:23,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:26:23,254 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:23,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 37 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:23,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-04 07:26:23,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-04 07:26:23,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 25 states have internal predecessors, (28), 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:26:23,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-03-04 07:26:23,282 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 6 [2025-03-04 07:26:23,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:23,282 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-03-04 07:26:23,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:23,283 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-03-04 07:26:23,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:26:23,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:23,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:26:23,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:26:23,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2025-03-04 07:26:23,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:23,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1951491038, now seen corresponding path program 1 times [2025-03-04 07:26:23,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:23,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391095650] [2025-03-04 07:26:23,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:23,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:23,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:26:23,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:26:23,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:23,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:23,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:23,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:23,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391095650] [2025-03-04 07:26:23,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391095650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:23,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:23,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:26:23,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933659030] [2025-03-04 07:26:23,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:23,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:26:23,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:23,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:26:23,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:26:23,448 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:23,496 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2025-03-04 07:26:23,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:26:23,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:26:23,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:23,497 INFO L225 Difference]: With dead ends: 32 [2025-03-04 07:26:23,498 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 07:26:23,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:26:23,498 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 55 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:26:23,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 55 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:23,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 07:26:23,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2025-03-04 07:26:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 30 states have internal predecessors, (35), 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:26:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-03-04 07:26:23,504 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 6 [2025-03-04 07:26:23,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:23,504 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-03-04 07:26:23,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2025-03-04 07:26:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:26:23,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:23,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:26:23,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:26:23,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2025-03-04 07:26:23,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:23,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1951491198, now seen corresponding path program 1 times [2025-03-04 07:26:23,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:23,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097989464] [2025-03-04 07:26:23,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:23,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:23,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:26:23,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:26:23,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:23,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:23,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:23,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097989464] [2025-03-04 07:26:23,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097989464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:23,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:23,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:26:23,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967507927] [2025-03-04 07:26:23,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:23,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:26:23,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:23,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:26:23,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:26:23,560 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:23,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:23,597 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2025-03-04 07:26:23,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:26:23,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:26:23,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:23,598 INFO L225 Difference]: With dead ends: 29 [2025-03-04 07:26:23,598 INFO L226 Difference]: Without dead ends: 29 [2025-03-04 07:26:23,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:26:23,600 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:23,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:23,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-04 07:26:23,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-04 07:26:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 28 states have internal predecessors, (31), 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:26:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2025-03-04 07:26:23,605 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 6 [2025-03-04 07:26:23,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:23,605 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2025-03-04 07:26:23,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:23,605 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2025-03-04 07:26:23,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:26:23,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:23,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:26:23,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:26:23,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2025-03-04 07:26:23,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1951520829, now seen corresponding path program 1 times [2025-03-04 07:26:23,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:23,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188480053] [2025-03-04 07:26:23,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:23,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:23,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:26:23,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:26:23,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:23,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:23,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:23,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:23,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188480053] [2025-03-04 07:26:23,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188480053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:23,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:23,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:26:23,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432709012] [2025-03-04 07:26:23,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:23,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:26:23,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:23,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:26:23,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:26:23,764 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:23,796 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2025-03-04 07:26:23,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:26:23,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:26:23,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:23,797 INFO L225 Difference]: With dead ends: 33 [2025-03-04 07:26:23,797 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 07:26:23,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:26:23,797 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:23,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 36 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:23,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 07:26:23,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2025-03-04 07:26:23,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.5) internal successors, (33), 29 states have internal predecessors, (33), 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:26:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2025-03-04 07:26:23,800 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 6 [2025-03-04 07:26:23,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:23,800 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2025-03-04 07:26:23,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:23,800 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2025-03-04 07:26:23,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:26:23,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:23,800 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:26:23,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:26:23,801 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2025-03-04 07:26:23,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:23,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1951520989, now seen corresponding path program 1 times [2025-03-04 07:26:23,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:23,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578477584] [2025-03-04 07:26:23,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:23,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:23,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:26:23,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:26:23,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:23,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:23,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:23,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578477584] [2025-03-04 07:26:23,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578477584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:23,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:23,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:26:23,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577549933] [2025-03-04 07:26:23,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:23,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:26:23,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:23,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:26:23,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:26:23,937 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:23,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:23,991 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2025-03-04 07:26:23,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:26:23,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:26:23,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:23,993 INFO L225 Difference]: With dead ends: 32 [2025-03-04 07:26:23,993 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 07:26:23,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:26:23,994 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:23,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 48 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 07:26:23,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2025-03-04 07:26:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 30 states have internal predecessors, (34), 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:26:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2025-03-04 07:26:23,996 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 6 [2025-03-04 07:26:23,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:23,996 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2025-03-04 07:26:23,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:23,996 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2025-03-04 07:26:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:26:23,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:23,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:23,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:26:23,997 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2025-03-04 07:26:23,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:23,998 INFO L85 PathProgramCache]: Analyzing trace with hash 192156599, now seen corresponding path program 1 times [2025-03-04 07:26:23,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:23,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992863345] [2025-03-04 07:26:23,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:23,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:24,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:26:24,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:26:24,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:24,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:24,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:24,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992863345] [2025-03-04 07:26:24,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992863345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:24,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:24,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:26:24,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687081464] [2025-03-04 07:26:24,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:24,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:26:24,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:24,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:26:24,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:26:24,069 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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:26:24,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:24,108 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2025-03-04 07:26:24,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:26:24,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 07:26:24,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:24,109 INFO L225 Difference]: With dead ends: 30 [2025-03-04 07:26:24,109 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 07:26:24,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:26:24,110 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:24,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 48 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:24,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 07:26:24,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 07:26:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.434782608695652) internal successors, (33), 29 states have internal predecessors, (33), 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:26:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2025-03-04 07:26:24,115 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 9 [2025-03-04 07:26:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:24,115 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2025-03-04 07:26:24,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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:26:24,115 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2025-03-04 07:26:24,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:26:24,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:24,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:24,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:26:24,115 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2025-03-04 07:26:24,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:24,116 INFO L85 PathProgramCache]: Analyzing trace with hash 192156600, now seen corresponding path program 1 times [2025-03-04 07:26:24,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:24,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131984663] [2025-03-04 07:26:24,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:24,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:24,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:26:24,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:26:24,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:24,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:24,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:24,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131984663] [2025-03-04 07:26:24,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131984663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:24,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:24,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:26:24,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528498373] [2025-03-04 07:26:24,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:24,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:26:24,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:24,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:26:24,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:26:24,277 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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:26:24,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:24,347 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2025-03-04 07:26:24,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:26:24,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 07:26:24,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:24,348 INFO L225 Difference]: With dead ends: 33 [2025-03-04 07:26:24,348 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 07:26:24,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:26:24,348 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:24,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 64 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:26:24,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 07:26:24,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-03-04 07:26:24,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 30 states have internal predecessors, (34), 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:26:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2025-03-04 07:26:24,351 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 9 [2025-03-04 07:26:24,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:24,352 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2025-03-04 07:26:24,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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:26:24,352 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2025-03-04 07:26:24,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:26:24,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:24,352 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:24,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:26:24,352 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2025-03-04 07:26:24,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:24,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1084431839, now seen corresponding path program 1 times [2025-03-04 07:26:24,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:24,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364971194] [2025-03-04 07:26:24,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:24,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:24,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:26:24,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:26:24,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:24,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:24,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:24,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364971194] [2025-03-04 07:26:24,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364971194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:24,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:24,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:26:24,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510896454] [2025-03-04 07:26:24,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:24,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:26:24,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:24,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:26:24,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:26:24,540 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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:26:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:24,562 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2025-03-04 07:26:24,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:26:24,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 07:26:24,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:24,563 INFO L225 Difference]: With dead ends: 30 [2025-03-04 07:26:24,563 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 07:26:24,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:26:24,563 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:24,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 34 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:24,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 07:26:24,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-03-04 07:26:24,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.391304347826087) internal successors, (32), 28 states have internal predecessors, (32), 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:26:24,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2025-03-04 07:26:24,565 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 9 [2025-03-04 07:26:24,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:24,565 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2025-03-04 07:26:24,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 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:26:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2025-03-04 07:26:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:26:24,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:24,566 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:24,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:26:24,566 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2025-03-04 07:26:24,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:24,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1084431999, now seen corresponding path program 1 times [2025-03-04 07:26:24,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:24,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532037297] [2025-03-04 07:26:24,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:24,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:24,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:26:24,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:26:24,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:24,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:24,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:24,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:24,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532037297] [2025-03-04 07:26:24,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532037297] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:26:24,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198727366] [2025-03-04 07:26:24,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:24,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:24,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:26:24,707 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:26:24,708 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:26:24,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:26:24,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:26:24,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:24,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:24,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:26:24,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:26:24,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-04 07:26:24,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:24,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:26:25,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:25,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198727366] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:26:25,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:26:25,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-03-04 07:26:25,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162135483] [2025-03-04 07:26:25,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:26:25,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 07:26:25,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:25,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 07:26:25,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:26:25,107 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:25,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:25,278 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-03-04 07:26:25,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:26:25,279 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 07:26:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:25,280 INFO L225 Difference]: With dead ends: 30 [2025-03-04 07:26:25,280 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 07:26:25,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:26:25,280 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:25,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 131 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:26:25,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 07:26:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2025-03-04 07:26:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 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:26:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-03-04 07:26:25,282 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 9 [2025-03-04 07:26:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:25,283 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-03-04 07:26:25,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:25,283 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-03-04 07:26:25,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:26:25,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:25,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:25,289 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:26:25,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:26:25,484 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2025-03-04 07:26:25,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:25,484 INFO L85 PathProgramCache]: Analyzing trace with hash -21102567, now seen corresponding path program 1 times [2025-03-04 07:26:25,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:25,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079605758] [2025-03-04 07:26:25,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:25,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:25,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:26:25,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:26:25,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:25,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:25,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:25,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079605758] [2025-03-04 07:26:25,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079605758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:25,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:25,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:26:25,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645011868] [2025-03-04 07:26:25,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:25,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:26:25,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:25,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:26:25,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:26:25,591 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:25,631 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2025-03-04 07:26:25,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:26:25,631 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 07:26:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:25,631 INFO L225 Difference]: With dead ends: 32 [2025-03-04 07:26:25,631 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 07:26:25,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:26:25,632 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:25,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 89 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:25,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 07:26:25,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2025-03-04 07:26:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 30 states have internal predecessors, (33), 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:26:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2025-03-04 07:26:25,635 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 11 [2025-03-04 07:26:25,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:25,636 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2025-03-04 07:26:25,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:25,637 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2025-03-04 07:26:25,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:26:25,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:25,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:25,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:26:25,637 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2025-03-04 07:26:25,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:25,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1828557030, now seen corresponding path program 1 times [2025-03-04 07:26:25,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:25,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218407761] [2025-03-04 07:26:25,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:25,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:25,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:26:25,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:26:25,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:25,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:25,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:25,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:25,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218407761] [2025-03-04 07:26:25,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218407761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:25,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:25,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:26:25,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731229853] [2025-03-04 07:26:25,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:25,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:26:25,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:25,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:26:25,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:26:25,772 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:25,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:25,828 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2025-03-04 07:26:25,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:26:25,829 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 07:26:25,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:25,829 INFO L225 Difference]: With dead ends: 40 [2025-03-04 07:26:25,829 INFO L226 Difference]: Without dead ends: 40 [2025-03-04 07:26:25,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:26:25,830 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:25,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 86 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:25,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-04 07:26:25,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2025-03-04 07:26:25,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 31 states have internal predecessors, (35), 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:26:25,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2025-03-04 07:26:25,834 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 11 [2025-03-04 07:26:25,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:25,834 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2025-03-04 07:26:25,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:25,835 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2025-03-04 07:26:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:26:25,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:25,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:25,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:26:25,835 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2025-03-04 07:26:25,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:25,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1195233362, now seen corresponding path program 1 times [2025-03-04 07:26:25,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:25,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409668623] [2025-03-04 07:26:25,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:25,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:25,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:26:25,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:26:25,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:25,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:25,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:25,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409668623] [2025-03-04 07:26:25,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409668623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:25,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:25,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:26:25,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193142473] [2025-03-04 07:26:25,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:25,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:26:25,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:25,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:26:25,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:26:25,872 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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:26:25,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:25,881 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2025-03-04 07:26:25,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:26:25,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 07:26:25,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:25,883 INFO L225 Difference]: With dead ends: 31 [2025-03-04 07:26:25,884 INFO L226 Difference]: Without dead ends: 31 [2025-03-04 07:26:25,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:26:25,884 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:25,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 63 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:25,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-04 07:26:25,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-04 07:26:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 30 states have internal predecessors, (34), 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:26:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2025-03-04 07:26:25,887 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 13 [2025-03-04 07:26:25,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:25,887 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2025-03-04 07:26:25,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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:26:25,887 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2025-03-04 07:26:25,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:26:25,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:25,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:25,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:26:25,889 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2025-03-04 07:26:25,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:25,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1602471467, now seen corresponding path program 1 times [2025-03-04 07:26:25,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:25,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590457772] [2025-03-04 07:26:25,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:25,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:26:25,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:26:25,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:25,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:26:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:26:25,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:26:25,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590457772] [2025-03-04 07:26:25,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590457772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:26:25,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:26:25,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:26:25,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284678673] [2025-03-04 07:26:25,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:26:25,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:26:25,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:26:25,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:26:25,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:26:25,927 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:26:25,948 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2025-03-04 07:26:25,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:26:25,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 07:26:25,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:26:25,949 INFO L225 Difference]: With dead ends: 30 [2025-03-04 07:26:25,949 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 07:26:25,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:26:25,950 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:26:25,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:26:25,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 07:26:25,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 07:26:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 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:26:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2025-03-04 07:26:25,951 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 14 [2025-03-04 07:26:25,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:26:25,951 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2025-03-04 07:26:25,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:26:25,951 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2025-03-04 07:26:25,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:26:25,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:26:25,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:25,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:26:25,954 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 7 more)] === [2025-03-04 07:26:25,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:26:25,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1541054792, now seen corresponding path program 1 times [2025-03-04 07:26:25,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:26:25,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342965710] [2025-03-04 07:26:25,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:26:25,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:26:25,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:26:25,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:26:25,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:25,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:26:25,971 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:26:25,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:26:25,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:26:25,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:26:25,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:26:25,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 07:26:25,991 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:26:25,992 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 10 remaining) [2025-03-04 07:26:25,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2025-03-04 07:26:25,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (7 of 10 remaining) [2025-03-04 07:26:25,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (6 of 10 remaining) [2025-03-04 07:26:25,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (5 of 10 remaining) [2025-03-04 07:26:25,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2025-03-04 07:26:25,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 10 remaining) [2025-03-04 07:26:25,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2025-03-04 07:26:25,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2025-03-04 07:26:25,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 10 remaining) [2025-03-04 07:26:25,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:26:25,997 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:26:26,013 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:26:26,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:26:26 BoogieIcfgContainer [2025-03-04 07:26:26,017 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:26:26,018 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:26:26,018 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:26:26,018 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:26:26,018 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:26:22" (3/4) ... [2025-03-04 07:26:26,019 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 07:26:26,046 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 8. [2025-03-04 07:26:26,079 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 07:26:26,079 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 07:26:26,079 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:26:26,080 INFO L158 Benchmark]: Toolchain (without parser) took 3774.26ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 46.4MB in the end (delta: 76.2MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. [2025-03-04 07:26:26,080 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:26:26,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.71ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 105.9MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:26:26,080 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.98ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 104.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:26:26,081 INFO L158 Benchmark]: Boogie Preprocessor took 28.69ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 102.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:26:26,081 INFO L158 Benchmark]: IcfgBuilder took 282.63ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 89.7MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:26:26,082 INFO L158 Benchmark]: TraceAbstraction took 3069.43ms. Allocated memory is still 167.8MB. Free memory was 89.1MB in the beginning and 52.0MB in the end (delta: 37.1MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2025-03-04 07:26:26,082 INFO L158 Benchmark]: Witness Printer took 61.47ms. Allocated memory is still 167.8MB. Free memory was 52.0MB in the beginning and 46.4MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:26:26,083 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.18ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.71ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 105.9MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.98ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 104.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.69ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 102.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 282.63ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 89.7MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3069.43ms. Allocated memory is still 167.8MB. Free memory was 89.1MB in the beginning and 52.0MB in the end (delta: 37.1MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * Witness Printer took 61.47ms. Allocated memory is still 167.8MB. Free memory was 52.0MB in the beginning and 46.4MB in the end (delta: 5.6MB). 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 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L537] CALL, EXPR build_nondet_String() [L515] int length = __VERIFIER_nondet_int(); [L516] COND FALSE !(length < 1) VAL [length=2] [L519] char* nondetString = (char*) malloc(length * sizeof(char)); [L521] int i = 0; VAL [i=0, length=2, nondetString={-1:0}] [L521] COND TRUE i < length - 1 [L523] nondetString[i] = __VERIFIER_nondet_char() [L521] i++ VAL [i=1, length=2, nondetString={-1:0}] [L521] COND FALSE !(i < length - 1) [L526] nondetString[length-1] = '\0' [L527] return nondetString; VAL [\result={-1:0}] [L537] RET, EXPR build_nondet_String() [L537] char* p = build_nondet_String(); [L538] CALL cstrlen(p) [L531] const char *p = s; VAL [p={-1:0}] [L532] EXPR \read(*p) [L532] COND TRUE *p != '\0' [L533] p = p+2 VAL [p={-1:2}] [L532] \read(*p) - UnprovableResult [Line: 536]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 796 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 550 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 592 IncrementalHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 246 mSDtfsCounter, 592 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=11, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 21 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 900 SizeOfPredicates, 1 NumberOfNonLiveVariables, 40 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 4/9 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-04 07:26:26,099 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)