./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-reverse.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 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:11:43,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:11:43,305 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 12:11:43,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:11:43,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:11:43,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:11:43,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:11:43,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:11:43,324 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:11:43,324 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:11:43,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:11:43,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:11:43,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:11:43,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:11:43,324 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:11:43,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:11:43,325 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:11:43,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:11:43,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:11:43,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:11:43,325 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:11:43,325 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:11:43,325 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:11:43,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:11:43,325 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:11:43,325 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:11:43,325 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:11:43,326 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:11:43,326 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:11:43,326 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:11:43,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:11:43,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:11:43,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:11:43,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:11:43,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:11:43,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:11:43,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:11:43,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:11:43,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:11:43,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:11:43,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:11:43,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:11:43,327 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 -> 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 [2025-03-17 12:11:43,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:11:43,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:11:43,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:11:43,570 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:11:43,570 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:11:43,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-reverse.i [2025-03-17 12:11:44,746 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44044f6c2/edfbb1ed8e51423da24a53b331c0d606/FLAGbe5b626e4 [2025-03-17 12:11:45,012 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:11:45,013 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i [2025-03-17 12:11:45,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44044f6c2/edfbb1ed8e51423da24a53b331c0d606/FLAGbe5b626e4 [2025-03-17 12:11:45,039 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44044f6c2/edfbb1ed8e51423da24a53b331c0d606 [2025-03-17 12:11:45,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:11:45,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:11:45,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:11:45,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:11:45,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:11:45,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:11:45" (1/1) ... [2025-03-17 12:11:45,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e950db3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:45, skipping insertion in model container [2025-03-17 12:11:45,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:11:45" (1/1) ... [2025-03-17 12:11:45,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:11:45,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:11:45,293 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:11:45,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:11:45,360 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:11:45,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:45 WrapperNode [2025-03-17 12:11:45,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:11:45,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:11:45,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:11:45,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:11:45,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:45" (1/1) ... [2025-03-17 12:11:45,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:45" (1/1) ... [2025-03-17 12:11:45,399 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 132 [2025-03-17 12:11:45,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:11:45,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:11:45,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:11:45,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:11:45,407 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:45" (1/1) ... [2025-03-17 12:11:45,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:45" (1/1) ... [2025-03-17 12:11:45,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:45" (1/1) ... [2025-03-17 12:11:45,429 INFO L175 MemorySlicer]: Split 33 memory accesses to 2 slices as follows [2, 31]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2025-03-17 12:11:45,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:45" (1/1) ... [2025-03-17 12:11:45,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:45" (1/1) ... [2025-03-17 12:11:45,434 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:45" (1/1) ... [2025-03-17 12:11:45,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:45" (1/1) ... [2025-03-17 12:11:45,436 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:45" (1/1) ... [2025-03-17 12:11:45,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:45" (1/1) ... [2025-03-17 12:11:45,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:11:45,439 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:11:45,439 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:11:45,439 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:11:45,440 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:45" (1/1) ... [2025-03-17 12:11:45,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:11:45,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:11:45,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 12:11:45,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 12:11:45,489 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-17 12:11:45,489 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-17 12:11:45,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 12:11:45,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 12:11:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:11:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 12:11:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:11:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:11:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:11:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 12:11:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:11:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 12:11:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:11:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 12:11:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 12:11:45,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:11:45,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:11:45,576 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:11:45,578 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:11:45,940 INFO L? ?]: Removed 146 outVars from TransFormulas that were not future-live. [2025-03-17 12:11:45,940 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:11:45,948 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:11:45,948 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:11:45,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:11:45 BoogieIcfgContainer [2025-03-17 12:11:45,949 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:11:45,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:11:45,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:11:45,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:11:45,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:11:45" (1/3) ... [2025-03-17 12:11:45,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe817fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:11:45, skipping insertion in model container [2025-03-17 12:11:45,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:11:45" (2/3) ... [2025-03-17 12:11:45,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe817fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:11:45, skipping insertion in model container [2025-03-17 12:11:45,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:11:45" (3/3) ... [2025-03-17 12:11:45,960 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2025-03-17 12:11:45,970 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:11:45,971 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-reverse.i that has 2 procedures, 149 locations, 1 initial locations, 8 loop locations, and 67 error locations. [2025-03-17 12:11:46,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:11:46,012 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;@726b1b6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:11:46,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2025-03-17 12:11:46,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 77 states have (on average 2.142857142857143) internal successors, (165), 144 states have internal predecessors, (165), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 12:11:46,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 12:11:46,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:46,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 12:11:46,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:11:46,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:46,025 INFO L85 PathProgramCache]: Analyzing trace with hash 6335, now seen corresponding path program 1 times [2025-03-17 12:11:46,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:46,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607144578] [2025-03-17 12:11:46,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:46,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:46,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 12:11:46,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 12:11:46,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:46,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:46,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:46,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607144578] [2025-03-17 12:11:46,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607144578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:11:46,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:11:46,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:11:46,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442852302] [2025-03-17 12:11:46,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:11:46,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:11:46,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:46,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:11:46,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:11:46,217 INFO L87 Difference]: Start difference. First operand has 149 states, 77 states have (on average 2.142857142857143) internal successors, (165), 144 states have internal predecessors, (165), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:46,384 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2025-03-17 12:11:46,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:11:46,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-03-17 12:11:46,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:46,391 INFO L225 Difference]: With dead ends: 141 [2025-03-17 12:11:46,392 INFO L226 Difference]: Without dead ends: 139 [2025-03-17 12:11:46,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:11:46,397 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 80 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:46,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 137 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:11:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-17 12:11:46,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-03-17 12:11:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 72 states have (on average 2.0277777777777777) internal successors, (146), 137 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2025-03-17 12:11:46,430 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 2 [2025-03-17 12:11:46,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:46,431 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2025-03-17 12:11:46,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:46,431 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2025-03-17 12:11:46,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 12:11:46,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:46,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 12:11:46,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:11:46,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:11:46,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:46,433 INFO L85 PathProgramCache]: Analyzing trace with hash 6336, now seen corresponding path program 1 times [2025-03-17 12:11:46,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:46,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779787982] [2025-03-17 12:11:46,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:46,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:46,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 12:11:46,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 12:11:46,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:46,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:46,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:46,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779787982] [2025-03-17 12:11:46,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779787982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:11:46,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:11:46,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:11:46,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726934721] [2025-03-17 12:11:46,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:11:46,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:11:46,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:46,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:11:46,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:11:46,506 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:46,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:46,612 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2025-03-17 12:11:46,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:11:46,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-03-17 12:11:46,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:46,613 INFO L225 Difference]: With dead ends: 136 [2025-03-17 12:11:46,613 INFO L226 Difference]: Without dead ends: 136 [2025-03-17 12:11:46,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:11:46,614 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 80 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:46,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 133 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:11:46,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-17 12:11:46,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-17 12:11:46,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 134 states have internal predecessors, (143), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2025-03-17 12:11:46,622 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 2 [2025-03-17 12:11:46,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:46,622 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2025-03-17 12:11:46,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:46,622 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2025-03-17 12:11:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 12:11:46,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:46,623 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:46,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:11:46,623 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:11:46,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:46,624 INFO L85 PathProgramCache]: Analyzing trace with hash -169218156, now seen corresponding path program 1 times [2025-03-17 12:11:46,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:46,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138710244] [2025-03-17 12:11:46,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:46,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:46,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 12:11:46,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 12:11:46,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:46,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:46,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:46,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138710244] [2025-03-17 12:11:46,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138710244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:11:46,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:11:46,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:11:46,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148674673] [2025-03-17 12:11:46,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:11:46,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:11:46,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:46,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:11:46,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:11:46,777 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:46,955 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2025-03-17 12:11:46,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:11:46,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2025-03-17 12:11:46,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:46,956 INFO L225 Difference]: With dead ends: 123 [2025-03-17 12:11:46,958 INFO L226 Difference]: Without dead ends: 123 [2025-03-17 12:11:46,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-17 12:11:46,958 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 117 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:46,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 90 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:11:46,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-17 12:11:46,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-03-17 12:11:46,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.763157894736842) internal successors, (134), 121 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2025-03-17 12:11:46,963 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 8 [2025-03-17 12:11:46,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:46,963 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2025-03-17 12:11:46,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:46,963 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2025-03-17 12:11:46,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 12:11:46,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:46,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:46,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:11:46,964 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:11:46,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:46,964 INFO L85 PathProgramCache]: Analyzing trace with hash -169218155, now seen corresponding path program 1 times [2025-03-17 12:11:46,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:46,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312027008] [2025-03-17 12:11:46,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:46,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:46,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 12:11:46,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 12:11:46,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:46,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:47,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:47,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312027008] [2025-03-17 12:11:47,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312027008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:11:47,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:11:47,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:11:47,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353994421] [2025-03-17 12:11:47,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:11:47,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:11:47,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:47,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:11:47,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:11:47,166 INFO L87 Difference]: Start difference. First operand 123 states and 137 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:47,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:47,369 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2025-03-17 12:11:47,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:11:47,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2025-03-17 12:11:47,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:47,370 INFO L225 Difference]: With dead ends: 160 [2025-03-17 12:11:47,370 INFO L226 Difference]: Without dead ends: 160 [2025-03-17 12:11:47,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:11:47,371 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 272 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:47,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 128 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:11:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-17 12:11:47,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 152. [2025-03-17 12:11:47,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 105 states have (on average 1.6285714285714286) internal successors, (171), 150 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:47,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2025-03-17 12:11:47,378 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 8 [2025-03-17 12:11:47,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:47,378 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2025-03-17 12:11:47,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:47,378 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2025-03-17 12:11:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 12:11:47,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:47,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:47,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:11:47,379 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:11:47,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:47,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1113637184, now seen corresponding path program 1 times [2025-03-17 12:11:47,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:47,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859696526] [2025-03-17 12:11:47,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:47,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:47,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 12:11:47,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 12:11:47,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:47,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:47,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:47,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859696526] [2025-03-17 12:11:47,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859696526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:11:47,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:11:47,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:11:47,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221987233] [2025-03-17 12:11:47,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:11:47,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:11:47,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:47,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:11:47,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:11:47,553 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-17 12:11:47,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:47,741 INFO L93 Difference]: Finished difference Result 151 states and 172 transitions. [2025-03-17 12:11:47,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:11:47,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-17 12:11:47,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:47,743 INFO L225 Difference]: With dead ends: 151 [2025-03-17 12:11:47,743 INFO L226 Difference]: Without dead ends: 151 [2025-03-17 12:11:47,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:11:47,744 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 3 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:47,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 290 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:11:47,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-17 12:11:47,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-17 12:11:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 105 states have (on average 1.6095238095238096) internal successors, (169), 149 states have internal predecessors, (169), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:47,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 172 transitions. [2025-03-17 12:11:47,749 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 172 transitions. Word has length 11 [2025-03-17 12:11:47,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:47,750 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 172 transitions. [2025-03-17 12:11:47,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-17 12:11:47,750 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 172 transitions. [2025-03-17 12:11:47,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 12:11:47,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:47,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:47,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:11:47,750 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:11:47,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:47,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1113637183, now seen corresponding path program 1 times [2025-03-17 12:11:47,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:47,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938878949] [2025-03-17 12:11:47,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:47,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:47,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 12:11:47,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 12:11:47,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:47,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:47,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:47,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:47,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938878949] [2025-03-17 12:11:47,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938878949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:11:47,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:11:47,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:11:47,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048093286] [2025-03-17 12:11:47,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:11:47,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:11:47,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:47,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:11:47,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:11:47,836 INFO L87 Difference]: Start difference. First operand 151 states and 172 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-17 12:11:47,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:47,955 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2025-03-17 12:11:47,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:11:47,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-17 12:11:47,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:47,957 INFO L225 Difference]: With dead ends: 150 [2025-03-17 12:11:47,957 INFO L226 Difference]: Without dead ends: 150 [2025-03-17 12:11:47,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:11:47,959 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 3 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:47,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 308 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:11:47,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-17 12:11:47,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-03-17 12:11:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 105 states have (on average 1.5904761904761904) internal successors, (167), 148 states have internal predecessors, (167), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2025-03-17 12:11:47,966 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 11 [2025-03-17 12:11:47,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:47,966 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2025-03-17 12:11:47,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-17 12:11:47,966 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2025-03-17 12:11:47,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 12:11:47,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:47,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:47,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 12:11:47,967 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:11:47,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:47,967 INFO L85 PathProgramCache]: Analyzing trace with hash -595762028, now seen corresponding path program 1 times [2025-03-17 12:11:47,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:47,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490602396] [2025-03-17 12:11:47,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:47,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:47,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 12:11:47,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 12:11:47,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:47,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:48,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:48,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490602396] [2025-03-17 12:11:48,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490602396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:11:48,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:11:48,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:11:48,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220984477] [2025-03-17 12:11:48,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:11:48,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:11:48,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:48,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:11:48,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:11:48,015 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:48,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:48,118 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2025-03-17 12:11:48,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:11:48,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-17 12:11:48,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:48,119 INFO L225 Difference]: With dead ends: 154 [2025-03-17 12:11:48,119 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 12:11:48,119 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-17 12:11:48,120 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 124 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:48,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 192 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:11:48,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 12:11:48,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2025-03-17 12:11:48,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 105 states have (on average 1.561904761904762) internal successors, (164), 148 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 167 transitions. [2025-03-17 12:11:48,126 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 167 transitions. Word has length 16 [2025-03-17 12:11:48,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:48,130 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 167 transitions. [2025-03-17 12:11:48,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:48,130 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2025-03-17 12:11:48,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 12:11:48,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:48,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:48,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:11:48,131 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:11:48,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:48,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1245437511, now seen corresponding path program 1 times [2025-03-17 12:11:48,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:48,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168741831] [2025-03-17 12:11:48,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:48,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:48,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 12:11:48,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 12:11:48,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:48,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:48,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:48,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168741831] [2025-03-17 12:11:48,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168741831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:11:48,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:11:48,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 12:11:48,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968751756] [2025-03-17 12:11:48,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:11:48,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 12:11:48,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:48,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 12:11:48,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:11:48,305 INFO L87 Difference]: Start difference. First operand 150 states and 167 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:48,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:48,570 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2025-03-17 12:11:48,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:11:48,570 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 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 15 [2025-03-17 12:11:48,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:48,570 INFO L225 Difference]: With dead ends: 149 [2025-03-17 12:11:48,571 INFO L226 Difference]: Without dead ends: 149 [2025-03-17 12:11:48,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-17 12:11:48,571 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 114 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:48,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 203 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:11:48,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-17 12:11:48,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-03-17 12:11:48,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 105 states have (on average 1.5523809523809524) internal successors, (163), 147 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 166 transitions. [2025-03-17 12:11:48,575 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 166 transitions. Word has length 15 [2025-03-17 12:11:48,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:48,575 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 166 transitions. [2025-03-17 12:11:48,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 166 transitions. [2025-03-17 12:11:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 12:11:48,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:48,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:48,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 12:11:48,576 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:11:48,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:48,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1245437510, now seen corresponding path program 1 times [2025-03-17 12:11:48,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:48,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746666078] [2025-03-17 12:11:48,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:48,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:48,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 12:11:48,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 12:11:48,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:48,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:48,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:48,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746666078] [2025-03-17 12:11:48,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746666078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:11:48,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:11:48,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 12:11:48,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146864121] [2025-03-17 12:11:48,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:11:48,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:11:48,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:48,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:11:48,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:11:48,858 INFO L87 Difference]: Start difference. First operand 149 states and 166 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:49,264 INFO L93 Difference]: Finished difference Result 145 states and 162 transitions. [2025-03-17 12:11:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 12:11:49,264 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 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 15 [2025-03-17 12:11:49,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:49,265 INFO L225 Difference]: With dead ends: 145 [2025-03-17 12:11:49,265 INFO L226 Difference]: Without dead ends: 145 [2025-03-17 12:11:49,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-17 12:11:49,266 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 117 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:49,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 261 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:11:49,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-17 12:11:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 136. [2025-03-17 12:11:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 97 states have (on average 1.5360824742268042) internal successors, (149), 134 states have internal predecessors, (149), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 152 transitions. [2025-03-17 12:11:49,270 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 152 transitions. Word has length 15 [2025-03-17 12:11:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:49,270 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 152 transitions. [2025-03-17 12:11:49,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 152 transitions. [2025-03-17 12:11:49,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 12:11:49,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:49,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:49,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 12:11:49,271 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:11:49,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:49,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1289480537, now seen corresponding path program 1 times [2025-03-17 12:11:49,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:49,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72346395] [2025-03-17 12:11:49,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:49,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:49,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 12:11:49,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 12:11:49,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:49,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:49,462 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-17 12:11:49,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:49,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72346395] [2025-03-17 12:11:49,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72346395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:11:49,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:11:49,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:11:49,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118203434] [2025-03-17 12:11:49,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:11:49,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:11:49,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:49,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:11:49,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:11:49,464 INFO L87 Difference]: Start difference. First operand 136 states and 152 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:49,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:49,622 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2025-03-17 12:11:49,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 12:11:49,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-17 12:11:49,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:49,623 INFO L225 Difference]: With dead ends: 153 [2025-03-17 12:11:49,623 INFO L226 Difference]: Without dead ends: 153 [2025-03-17 12:11:49,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:11:49,624 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 24 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:49,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 428 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:11:49,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-17 12:11:49,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 144. [2025-03-17 12:11:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 105 states have (on average 1.5047619047619047) internal successors, (158), 142 states have internal predecessors, (158), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 161 transitions. [2025-03-17 12:11:49,630 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 161 transitions. Word has length 17 [2025-03-17 12:11:49,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:49,630 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 161 transitions. [2025-03-17 12:11:49,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 161 transitions. [2025-03-17 12:11:49,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 12:11:49,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:49,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:49,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 12:11:49,631 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:11:49,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:49,632 INFO L85 PathProgramCache]: Analyzing trace with hash 492008007, now seen corresponding path program 1 times [2025-03-17 12:11:49,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:49,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569912916] [2025-03-17 12:11:49,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:49,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:49,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 12:11:49,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 12:11:49,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:49,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:49,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:49,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569912916] [2025-03-17 12:11:49,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569912916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:11:49,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:11:49,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:11:49,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322462438] [2025-03-17 12:11:49,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:11:49,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:11:49,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:49,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:11:49,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:11:49,753 INFO L87 Difference]: Start difference. First operand 144 states and 161 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:49,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:49,932 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2025-03-17 12:11:49,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:11:49,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2025-03-17 12:11:49,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:49,933 INFO L225 Difference]: With dead ends: 158 [2025-03-17 12:11:49,935 INFO L226 Difference]: Without dead ends: 158 [2025-03-17 12:11:49,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:11:49,935 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 6 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:49,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 352 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:11:49,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-17 12:11:49,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2025-03-17 12:11:49,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 115 states have (on average 1.4869565217391305) internal successors, (171), 152 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:49,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 174 transitions. [2025-03-17 12:11:49,939 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 174 transitions. Word has length 19 [2025-03-17 12:11:49,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:49,940 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 174 transitions. [2025-03-17 12:11:49,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:49,940 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 174 transitions. [2025-03-17 12:11:49,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:11:49,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:49,941 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:49,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 12:11:49,941 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:11:49,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:49,942 INFO L85 PathProgramCache]: Analyzing trace with hash 366615839, now seen corresponding path program 1 times [2025-03-17 12:11:49,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:49,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526067747] [2025-03-17 12:11:49,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:49,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:49,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:11:49,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:11:49,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:49,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:50,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:50,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:50,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526067747] [2025-03-17 12:11:50,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526067747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:11:50,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:11:50,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:11:50,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142013786] [2025-03-17 12:11:50,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:11:50,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:11:50,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:50,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:11:50,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:11:50,005 INFO L87 Difference]: Start difference. First operand 154 states and 174 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:50,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:50,114 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2025-03-17 12:11:50,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:11:50,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 21 [2025-03-17 12:11:50,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:50,115 INFO L225 Difference]: With dead ends: 153 [2025-03-17 12:11:50,115 INFO L226 Difference]: Without dead ends: 153 [2025-03-17 12:11:50,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:11:50,116 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:50,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 287 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:11:50,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-17 12:11:50,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-03-17 12:11:50,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 151 states have internal predecessors, (169), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2025-03-17 12:11:50,119 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 21 [2025-03-17 12:11:50,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:50,119 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2025-03-17 12:11:50,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:50,119 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2025-03-17 12:11:50,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 12:11:50,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:50,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:50,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 12:11:50,120 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:11:50,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:50,120 INFO L85 PathProgramCache]: Analyzing trace with hash 366615840, now seen corresponding path program 1 times [2025-03-17 12:11:50,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:50,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555728627] [2025-03-17 12:11:50,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:50,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:50,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 12:11:50,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 12:11:50,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:50,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:50,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:50,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:50,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555728627] [2025-03-17 12:11:50,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555728627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:11:50,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:11:50,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:11:50,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391452826] [2025-03-17 12:11:50,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:11:50,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:11:50,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:50,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:11:50,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:11:50,223 INFO L87 Difference]: Start difference. First operand 153 states and 172 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:50,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:50,345 INFO L93 Difference]: Finished difference Result 152 states and 170 transitions. [2025-03-17 12:11:50,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:11:50,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 21 [2025-03-17 12:11:50,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:50,346 INFO L225 Difference]: With dead ends: 152 [2025-03-17 12:11:50,346 INFO L226 Difference]: Without dead ends: 152 [2025-03-17 12:11:50,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:11:50,346 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 2 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:50,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 277 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:11:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-17 12:11:50,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-03-17 12:11:50,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 115 states have (on average 1.4521739130434783) internal successors, (167), 150 states have internal predecessors, (167), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:50,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 170 transitions. [2025-03-17 12:11:50,349 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 170 transitions. Word has length 21 [2025-03-17 12:11:50,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:50,350 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 170 transitions. [2025-03-17 12:11:50,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:50,350 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 170 transitions. [2025-03-17 12:11:50,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:11:50,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:50,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:50,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 12:11:50,350 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:11:50,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:50,351 INFO L85 PathProgramCache]: Analyzing trace with hash 860812761, now seen corresponding path program 1 times [2025-03-17 12:11:50,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:50,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977403857] [2025-03-17 12:11:50,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:50,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:50,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:11:50,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:11:50,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:50,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:50,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:50,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977403857] [2025-03-17 12:11:50,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977403857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:11:50,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:11:50,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 12:11:50,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077373414] [2025-03-17 12:11:50,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:11:50,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 12:11:50,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:50,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 12:11:50,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:11:50,478 INFO L87 Difference]: Start difference. First operand 152 states and 170 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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-17 12:11:50,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:50,751 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2025-03-17 12:11:50,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 12:11:50,751 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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 25 [2025-03-17 12:11:50,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:50,752 INFO L225 Difference]: With dead ends: 151 [2025-03-17 12:11:50,752 INFO L226 Difference]: Without dead ends: 151 [2025-03-17 12:11:50,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-17 12:11:50,752 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 94 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:50,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 227 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:11:50,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-17 12:11:50,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-17 12:11:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 115 states have (on average 1.4434782608695653) internal successors, (166), 149 states have internal predecessors, (166), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:50,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 169 transitions. [2025-03-17 12:11:50,756 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 169 transitions. Word has length 25 [2025-03-17 12:11:50,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:50,756 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 169 transitions. [2025-03-17 12:11:50,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 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-17 12:11:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 169 transitions. [2025-03-17 12:11:50,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:11:50,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:50,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:50,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 12:11:50,757 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:11:50,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:50,757 INFO L85 PathProgramCache]: Analyzing trace with hash 860812762, now seen corresponding path program 1 times [2025-03-17 12:11:50,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:50,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758394790] [2025-03-17 12:11:50,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:50,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:50,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:11:50,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:11:50,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:50,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:50,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:50,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:50,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758394790] [2025-03-17 12:11:50,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758394790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:11:50,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:11:50,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 12:11:50,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072866424] [2025-03-17 12:11:50,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:11:50,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 12:11:50,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:50,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 12:11:50,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:11:50,972 INFO L87 Difference]: Start difference. First operand 151 states and 169 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 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-17 12:11:51,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:51,260 INFO L93 Difference]: Finished difference Result 149 states and 167 transitions. [2025-03-17 12:11:51,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 12:11:51,261 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 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 25 [2025-03-17 12:11:51,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:51,261 INFO L225 Difference]: With dead ends: 149 [2025-03-17 12:11:51,261 INFO L226 Difference]: Without dead ends: 149 [2025-03-17 12:11:51,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-03-17 12:11:51,262 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 92 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:51,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 245 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:11:51,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-17 12:11:51,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-03-17 12:11:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 115 states have (on average 1.4260869565217391) internal successors, (164), 147 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:51,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 167 transitions. [2025-03-17 12:11:51,265 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 167 transitions. Word has length 25 [2025-03-17 12:11:51,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:51,265 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 167 transitions. [2025-03-17 12:11:51,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 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-17 12:11:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 167 transitions. [2025-03-17 12:11:51,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:11:51,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:51,266 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:51,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 12:11:51,266 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:11:51,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:51,266 INFO L85 PathProgramCache]: Analyzing trace with hash 97240559, now seen corresponding path program 1 times [2025-03-17 12:11:51,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:51,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398870365] [2025-03-17 12:11:51,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:51,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:51,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:11:51,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:11:51,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:51,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:51,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:51,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398870365] [2025-03-17 12:11:51,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398870365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:11:51,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475479925] [2025-03-17 12:11:51,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:51,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:11:51,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:11:51,639 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:11:51,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 12:11:51,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:11:51,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:11:51,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:51,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:51,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-17 12:11:51,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:11:51,766 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 6 treesize of output 5 [2025-03-17 12:11:51,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:11:51,856 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:11:51,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:11:51,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:11:51,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:11:51,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:51,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2025-03-17 12:11:52,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 12:11:52,213 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2025-03-17 12:11:52,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2025-03-17 12:11:52,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 12:11:52,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:52,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:11:52,274 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:11:52,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-17 12:11:52,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 12:11:52,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 12:11:52,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 12:11:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:52,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:11:52,777 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|))))) (forall ((v_ArrVal_489 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_489) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|) 1))))) is different from false [2025-03-17 12:11:52,897 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_489) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|))) (forall ((v_ArrVal_489 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_489) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|) 1)) (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|))))) is different from false [2025-03-17 12:11:52,951 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base|) (+ |c_ULTIMATE.start_main_#t~mem4#1.offset| 4) |c_ULTIMATE.start_main_~x~0#1.base|)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_486 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_486) .cse0 v_ArrVal_489) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|) 3) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|))) (forall ((v_ArrVal_486 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_486) .cse0 v_ArrVal_489) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|) 1))))))) is different from false [2025-03-17 12:11:52,998 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem4#1.offset_9| Int)) (or (< |v_ULTIMATE.start_main_#t~mem4#1.offset_9| .cse0) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_486 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse4 (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_9| 4) |c_ULTIMATE.start_main_~x~0#1.base|)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_486) .cse2 v_ArrVal_489) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|) 3) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|))))))))) (forall ((|v_ULTIMATE.start_main_#t~mem4#1.offset_9| Int)) (or (forall ((v_ArrVal_486 (Array Int Int)) (v_ArrVal_489 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_79| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_79| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_79|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_486) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 (store .cse4 (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_9| 4) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_489) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_79|) 1)))) (< |v_ULTIMATE.start_main_#t~mem4#1.offset_9| .cse0)))))) is different from false [2025-03-17 12:11:53,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:53,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2025-03-17 12:11:53,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:53,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 103 [2025-03-17 12:11:53,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 82 [2025-03-17 12:11:53,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2025-03-17 12:11:53,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:53,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 119 [2025-03-17 12:11:53,150 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:11:53,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:53,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-03-17 12:11:53,159 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:11:53,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:53,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:53,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-03-17 12:11:53,166 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:11:53,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:53,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:53,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-03-17 12:11:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:53,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475479925] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:11:53,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:11:53,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 39 [2025-03-17 12:11:53,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607357341] [2025-03-17 12:11:53,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:11:53,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-17 12:11:53,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:53,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-17 12:11:53,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1125, Unknown=11, NotChecked=284, Total=1560 [2025-03-17 12:11:53,422 INFO L87 Difference]: Start difference. First operand 149 states and 167 transitions. Second operand has 40 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:55,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:55,263 INFO L93 Difference]: Finished difference Result 248 states and 286 transitions. [2025-03-17 12:11:55,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 12:11:55,263 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 40 states have internal predecessors, (84), 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 28 [2025-03-17 12:11:55,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:55,264 INFO L225 Difference]: With dead ends: 248 [2025-03-17 12:11:55,264 INFO L226 Difference]: Without dead ends: 248 [2025-03-17 12:11:55,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=414, Invalid=2452, Unknown=12, NotChecked=428, Total=3306 [2025-03-17 12:11:55,265 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 691 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 2212 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 3215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 909 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:55,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1356 Invalid, 3215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2212 Invalid, 0 Unknown, 909 Unchecked, 1.2s Time] [2025-03-17 12:11:55,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-17 12:11:55,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 168. [2025-03-17 12:11:55,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 140 states have (on average 1.3785714285714286) internal successors, (193), 166 states have internal predecessors, (193), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 196 transitions. [2025-03-17 12:11:55,269 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 196 transitions. Word has length 28 [2025-03-17 12:11:55,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:55,269 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 196 transitions. [2025-03-17 12:11:55,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:55,269 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 196 transitions. [2025-03-17 12:11:55,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:11:55,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:55,270 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:55,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 12:11:55,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 12:11:55,474 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:11:55,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:55,474 INFO L85 PathProgramCache]: Analyzing trace with hash 97240558, now seen corresponding path program 1 times [2025-03-17 12:11:55,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:55,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890051546] [2025-03-17 12:11:55,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:55,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:55,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:11:55,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:11:55,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:55,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:55,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:55,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890051546] [2025-03-17 12:11:55,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890051546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:11:55,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173956898] [2025-03-17 12:11:55,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:55,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:11:55,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:11:55,714 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:11:55,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 12:11:55,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:11:55,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:11:55,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:55,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:55,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-17 12:11:55,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:11:55,809 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 6 treesize of output 5 [2025-03-17 12:11:55,860 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:11:55,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:11:55,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:11:55,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:11:55,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 12:11:55,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:55,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2025-03-17 12:11:56,083 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2025-03-17 12:11:56,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 29 [2025-03-17 12:11:56,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 12:11:56,119 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:11:56,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-17 12:11:56,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 12:11:56,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:56,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:11:56,382 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2025-03-17 12:11:56,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-03-17 12:11:56,691 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-17 12:11:56,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 184 treesize of output 178 [2025-03-17 12:11:56,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:56,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 141 [2025-03-17 12:11:56,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 89 [2025-03-17 12:11:56,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-17 12:11:56,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:56,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-17 12:11:56,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:11:56,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173956898] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:11:56,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:11:56,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 35 [2025-03-17 12:11:56,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793831380] [2025-03-17 12:11:56,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:11:56,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-17 12:11:56,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:56,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-17 12:11:56,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1132, Unknown=15, NotChecked=0, Total=1260 [2025-03-17 12:11:56,987 INFO L87 Difference]: Start difference. First operand 168 states and 196 transitions. Second operand has 36 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:11:58,152 INFO L93 Difference]: Finished difference Result 229 states and 264 transitions. [2025-03-17 12:11:58,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 12:11:58,152 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 36 states have internal predecessors, (74), 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 28 [2025-03-17 12:11:58,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:11:58,154 INFO L225 Difference]: With dead ends: 229 [2025-03-17 12:11:58,154 INFO L226 Difference]: Without dead ends: 229 [2025-03-17 12:11:58,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=308, Invalid=1933, Unknown=15, NotChecked=0, Total=2256 [2025-03-17 12:11:58,155 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 573 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 1849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 12:11:58,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 901 Invalid, 1849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 12:11:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-17 12:11:58,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 168. [2025-03-17 12:11:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 140 states have (on average 1.3714285714285714) internal successors, (192), 166 states have internal predecessors, (192), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 195 transitions. [2025-03-17 12:11:58,158 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 195 transitions. Word has length 28 [2025-03-17 12:11:58,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:11:58,158 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 195 transitions. [2025-03-17 12:11:58,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:11:58,159 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 195 transitions. [2025-03-17 12:11:58,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:11:58,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:11:58,159 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:11:58,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 12:11:58,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 12:11:58,360 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:11:58,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:11:58,360 INFO L85 PathProgramCache]: Analyzing trace with hash -796393330, now seen corresponding path program 1 times [2025-03-17 12:11:58,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:11:58,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455699654] [2025-03-17 12:11:58,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:58,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:11:58,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:11:58,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:11:58,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:58,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:58,615 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-17 12:11:58,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:11:58,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455699654] [2025-03-17 12:11:58,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455699654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:11:58,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074536726] [2025-03-17 12:11:58,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:11:58,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:11:58,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:11:58,618 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:11:58,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 12:11:58,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:11:58,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:11:58,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:11:58,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:11:58,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 12:11:58,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:11:58,711 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 6 treesize of output 5 [2025-03-17 12:11:58,759 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:11:58,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:11:58,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:11:58,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:11:58,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 12:11:58,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:11:58,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2025-03-17 12:11:58,965 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2025-03-17 12:11:58,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2025-03-17 12:11:58,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 12:11:58,993 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:11:58,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-17 12:11:59,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-03-17 12:11:59,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 12:11:59,084 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-17 12:11:59,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:11:59,280 INFO L349 Elim1Store]: treesize reduction 5, result has 87.2 percent of original size [2025-03-17 12:11:59,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 42 [2025-03-17 12:11:59,408 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-17 12:11:59,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 184 treesize of output 178 [2025-03-17 12:11:59,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:59,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 141 [2025-03-17 12:11:59,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 89 [2025-03-17 12:11:59,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-17 12:11:59,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:11:59,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-17 12:11:59,664 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-17 12:11:59,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074536726] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:11:59,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:11:59,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 33 [2025-03-17 12:11:59,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053129405] [2025-03-17 12:11:59,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:11:59,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 12:11:59,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:11:59,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 12:11:59,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=992, Unknown=10, NotChecked=0, Total=1122 [2025-03-17 12:11:59,666 INFO L87 Difference]: Start difference. First operand 168 states and 195 transitions. Second operand has 34 states, 33 states have (on average 2.393939393939394) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:00,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:00,605 INFO L93 Difference]: Finished difference Result 228 states and 263 transitions. [2025-03-17 12:12:00,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 12:12:00,605 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.393939393939394) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-17 12:12:00,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:00,606 INFO L225 Difference]: With dead ends: 228 [2025-03-17 12:12:00,606 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 12:12:00,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=275, Invalid=1607, Unknown=10, NotChecked=0, Total=1892 [2025-03-17 12:12:00,607 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 459 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 1687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:00,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 976 Invalid, 1687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 12:12:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 12:12:00,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 175. [2025-03-17 12:12:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 147 states have (on average 1.3673469387755102) internal successors, (201), 173 states have internal predecessors, (201), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:00,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 204 transitions. [2025-03-17 12:12:00,611 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 204 transitions. Word has length 30 [2025-03-17 12:12:00,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:00,611 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 204 transitions. [2025-03-17 12:12:00,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.393939393939394) internal successors, (79), 34 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:00,611 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 204 transitions. [2025-03-17 12:12:00,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:12:00,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:00,612 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:00,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 12:12:00,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 12:12:00,817 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:12:00,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:00,817 INFO L85 PathProgramCache]: Analyzing trace with hash -796393329, now seen corresponding path program 1 times [2025-03-17 12:12:00,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:00,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828256820] [2025-03-17 12:12:00,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:00,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:00,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:12:00,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:12:00,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:00,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:01,173 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-17 12:12:01,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:01,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828256820] [2025-03-17 12:12:01,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828256820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:01,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813449528] [2025-03-17 12:12:01,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:01,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:01,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:01,178 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:12:01,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 12:12:01,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:12:01,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:12:01,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:01,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:01,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-17 12:12:01,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:12:01,275 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 6 treesize of output 5 [2025-03-17 12:12:01,324 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:12:01,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:12:01,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:12:01,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:12:01,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:12:01,434 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:12:01,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-17 12:12:01,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 12:12:01,513 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:12:01,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-17 12:12:01,522 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-17 12:12:01,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2025-03-17 12:12:01,545 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:12:01,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-17 12:12:01,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 12:12:01,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:12:01,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-03-17 12:12:01,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 12:12:01,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 12:12:01,671 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-17 12:12:01,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:12:01,885 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_818 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_95| Int) (v_ArrVal_819 (Array Int Int))) (or (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_95|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_95|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_95|) (< |v_ULTIMATE.start_main_~x~0#1.offset_95| 0))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_95| Int) (v_ArrVal_819 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_95|) (< |v_ULTIMATE.start_main_~x~0#1.offset_95| 0) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_95|) 9))))) is different from false [2025-03-17 12:12:01,979 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_95| Int) (v_ArrVal_819 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_95|) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_814) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_815) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_819) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_95|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_95| 0))) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (v_ArrVal_818 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_95| Int) (v_ArrVal_819 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_815))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ 11 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_814) .cse0 v_ArrVal_819) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_95|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_95|))))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_95|) (< |v_ULTIMATE.start_main_~x~0#1.offset_95| 0)))) is different from false [2025-03-17 12:12:02,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:02,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2025-03-17 12:12:02,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:02,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2025-03-17 12:12:02,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:02,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 632 treesize of output 567 [2025-03-17 12:12:02,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:02,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1127 treesize of output 1070 [2025-03-17 12:12:02,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 547 treesize of output 523 [2025-03-17 12:12:02,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 523 treesize of output 499 [2025-03-17 12:12:02,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 499 treesize of output 491 [2025-03-17 12:12:02,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:02,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 491 treesize of output 447 [2025-03-17 12:12:02,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:02,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2025-03-17 12:12:02,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:02,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2025-03-17 12:12:02,476 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:12:02,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-03-17 12:12:02,481 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:12:02,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:12:02,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:12:02,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 12:12:02,644 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-17 12:12:02,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813449528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:12:02,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:12:02,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 33 [2025-03-17 12:12:02,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164305953] [2025-03-17 12:12:02,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:12:02,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-17 12:12:02,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:02,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-17 12:12:02,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=849, Unknown=20, NotChecked=122, Total=1122 [2025-03-17 12:12:02,645 INFO L87 Difference]: Start difference. First operand 175 states and 204 transitions. Second operand has 34 states, 33 states have (on average 2.696969696969697) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:03,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:03,419 INFO L93 Difference]: Finished difference Result 228 states and 263 transitions. [2025-03-17 12:12:03,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 12:12:03,420 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.696969696969697) internal successors, (89), 34 states have internal predecessors, (89), 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 30 [2025-03-17 12:12:03,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:03,421 INFO L225 Difference]: With dead ends: 228 [2025-03-17 12:12:03,421 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 12:12:03,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=229, Invalid=1241, Unknown=20, NotChecked=150, Total=1640 [2025-03-17 12:12:03,421 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 307 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 345 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:03,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 827 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1319 Invalid, 0 Unknown, 345 Unchecked, 0.6s Time] [2025-03-17 12:12:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 12:12:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 175. [2025-03-17 12:12:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 147 states have (on average 1.3605442176870748) internal successors, (200), 173 states have internal predecessors, (200), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 203 transitions. [2025-03-17 12:12:03,425 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 203 transitions. Word has length 30 [2025-03-17 12:12:03,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:03,425 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 203 transitions. [2025-03-17 12:12:03,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.696969696969697) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:03,425 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 203 transitions. [2025-03-17 12:12:03,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:12:03,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:03,426 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:03,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 12:12:03,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:03,626 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:12:03,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:03,627 INFO L85 PathProgramCache]: Analyzing trace with hash 268662244, now seen corresponding path program 1 times [2025-03-17 12:12:03,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:03,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982250806] [2025-03-17 12:12:03,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:03,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:03,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:12:03,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:12:03,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:03,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:12:03,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:03,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982250806] [2025-03-17 12:12:03,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982250806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:03,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108273796] [2025-03-17 12:12:03,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:03,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:03,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:03,762 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:12:03,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 12:12:03,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:12:03,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:12:03,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:03,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:03,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 12:12:03,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:12:03,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:12:03,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 12:12:03,894 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:12:03,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:12:03,900 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:12:03,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:12:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:12:03,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108273796] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:12:03,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:12:03,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 7 [2025-03-17 12:12:03,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243840308] [2025-03-17 12:12:03,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:12:03,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 12:12:03,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:12:03,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 12:12:03,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 12:12:03,945 INFO L87 Difference]: Start difference. First operand 175 states and 203 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:12:04,057 INFO L93 Difference]: Finished difference Result 173 states and 196 transitions. [2025-03-17 12:12:04,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:12:04,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-17 12:12:04,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:12:04,058 INFO L225 Difference]: With dead ends: 173 [2025-03-17 12:12:04,058 INFO L226 Difference]: Without dead ends: 173 [2025-03-17 12:12:04,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-17 12:12:04,058 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 152 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:12:04,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 84 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:12:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-17 12:12:04,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 165. [2025-03-17 12:12:04,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 139 states have (on average 1.330935251798561) internal successors, (185), 163 states have internal predecessors, (185), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:04,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 186 transitions. [2025-03-17 12:12:04,062 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 186 transitions. Word has length 35 [2025-03-17 12:12:04,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:12:04,062 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 186 transitions. [2025-03-17 12:12:04,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 7 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:12:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2025-03-17 12:12:04,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:12:04,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:12:04,063 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:12:04,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 12:12:04,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:04,264 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 64 more)] === [2025-03-17 12:12:04,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:12:04,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1428092046, now seen corresponding path program 1 times [2025-03-17 12:12:04,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:12:04,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502987698] [2025-03-17 12:12:04,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:04,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:12:04,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:12:04,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:12:04,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:04,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:04,528 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-17 12:12:04,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:12:04,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502987698] [2025-03-17 12:12:04,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502987698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:12:04,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087605796] [2025-03-17 12:12:04,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:12:04,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:12:04,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:12:04,534 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:12:04,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 12:12:04,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:12:04,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:12:04,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:12:04,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:12:04,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 12:12:04,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:12:04,765 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:12:04,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 12:12:04,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:12:04,887 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:12:04,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-17 12:12:04,997 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-03-17 12:12:04,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2025-03-17 12:12:05,020 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:12:05,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-17 12:12:05,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 12:12:05,169 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-17 12:12:05,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:12:05,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:05,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2025-03-17 12:12:05,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:05,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 131 [2025-03-17 12:12:05,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:05,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 78 [2025-03-17 12:12:05,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2025-03-17 12:12:19,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:12:19,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 25 select indices, 25 select index equivalence classes, 0 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 300 case distinctions, treesize of input 386 treesize of output 2726