./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.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 8246e56f0c6a2a64017cfdd94b26580c43f90ed61973daa969baf2d0942f8a17 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:38:29,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:38:29,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 22:38:29,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:38:29,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:38:29,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:38:29,387 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:38:29,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:38:29,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:38:29,387 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:38:29,387 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:38:29,387 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:38:29,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:38:29,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:38:29,388 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:38:29,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:38:29,388 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:38:29,388 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:38:29,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:38:29,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:38:29,388 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:38:29,388 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:38:29,389 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 22:38:29,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:38:29,389 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:38:29,389 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:38:29,389 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:38:29,389 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:38:29,389 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:38:29,389 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:38:29,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:38:29,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:38:29,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:38:29,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:38:29,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:38:29,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:38:29,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:38:29,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:38:29,390 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:38:29,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:38:29,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:38:29,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:38:29,390 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 -> 8246e56f0c6a2a64017cfdd94b26580c43f90ed61973daa969baf2d0942f8a17 [2025-03-08 22:38:29,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:38:29,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:38:29,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:38:29,638 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:38:29,638 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:38:29,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2025-03-08 22:38:30,806 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdc76c20b/70e6dcfa8e55405c92aa6346af1c85bc/FLAG6d0ea1ea4 [2025-03-08 22:38:31,106 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:38:31,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2025-03-08 22:38:31,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdc76c20b/70e6dcfa8e55405c92aa6346af1c85bc/FLAG6d0ea1ea4 [2025-03-08 22:38:31,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdc76c20b/70e6dcfa8e55405c92aa6346af1c85bc [2025-03-08 22:38:31,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:38:31,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:38:31,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:38:31,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:38:31,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:38:31,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:38:31" (1/1) ... [2025-03-08 22:38:31,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6467c8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:31, skipping insertion in model container [2025-03-08 22:38:31,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:38:31" (1/1) ... [2025-03-08 22:38:31,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:38:31,567 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:38:31,568 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-08 22:38:31,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:38:31,576 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:38:31,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:38:31,618 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:38:31,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:31 WrapperNode [2025-03-08 22:38:31,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:38:31,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:38:31,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:38:31,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:38:31,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:31" (1/1) ... [2025-03-08 22:38:31,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:31" (1/1) ... [2025-03-08 22:38:31,644 INFO L138 Inliner]: procedures = 117, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2025-03-08 22:38:31,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:38:31,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:38:31,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:38:31,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:38:31,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:31" (1/1) ... [2025-03-08 22:38:31,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:31" (1/1) ... [2025-03-08 22:38:31,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:31" (1/1) ... [2025-03-08 22:38:31,666 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-03-08 22:38:31,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:31" (1/1) ... [2025-03-08 22:38:31,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:31" (1/1) ... [2025-03-08 22:38:31,670 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:31" (1/1) ... [2025-03-08 22:38:31,670 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:31" (1/1) ... [2025-03-08 22:38:31,671 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:31" (1/1) ... [2025-03-08 22:38:31,672 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:31" (1/1) ... [2025-03-08 22:38:31,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:38:31,673 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:38:31,673 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:38:31,673 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:38:31,674 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:31" (1/1) ... [2025-03-08 22:38:31,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:38:31,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:31,697 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-08 22:38:31,702 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-08 22:38:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:38:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:38:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:38:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:38:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:38:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:38:31,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:38:31,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:38:31,782 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:38:31,783 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:38:31,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L541: call ULTIMATE.dealloc(main_#t~malloc10#1.base, main_#t~malloc10#1.offset);havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call ULTIMATE.dealloc(main_#t~malloc11#1.base, main_#t~malloc11#1.offset);havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset; [2025-03-08 22:38:31,962 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-03-08 22:38:31,962 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:38:31,973 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:38:31,974 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:38:31,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:38:31 BoogieIcfgContainer [2025-03-08 22:38:31,974 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:38:31,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:38:31,977 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:38:31,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:38:31,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:38:31" (1/3) ... [2025-03-08 22:38:31,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68954bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:38:31, skipping insertion in model container [2025-03-08 22:38:31,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:38:31" (2/3) ... [2025-03-08 22:38:31,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68954bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:38:31, skipping insertion in model container [2025-03-08 22:38:31,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:38:31" (3/3) ... [2025-03-08 22:38:31,983 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca-2.i [2025-03-08 22:38:31,998 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:38:31,999 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrncpy-alloca-2.i that has 1 procedures, 33 locations, 1 initial locations, 3 loop locations, and 11 error locations. [2025-03-08 22:38:32,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:38:32,044 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;@47591854, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:38:32,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-08 22:38:32,048 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 32 states have internal predecessors, (39), 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-08 22:38:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:38:32,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:32,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:32,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:32,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:32,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1574209764, now seen corresponding path program 1 times [2025-03-08 22:38:32,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:32,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774098405] [2025-03-08 22:38:32,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:32,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:32,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:38:32,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:38:32,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:32,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:32,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:32,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774098405] [2025-03-08 22:38:32,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774098405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:32,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:32,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:38:32,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015466740] [2025-03-08 22:38:32,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:32,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:38:32,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:32,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:38:32,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:38:32,299 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-08 22:38:32,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:32,322 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2025-03-08 22:38:32,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:38:32,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-03-08 22:38:32,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:32,328 INFO L225 Difference]: With dead ends: 38 [2025-03-08 22:38:32,328 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 22:38:32,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:38:32,330 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:32,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 66 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:32,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 22:38:32,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-03-08 22:38:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 33 states have internal predecessors, (40), 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-08 22:38:32,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2025-03-08 22:38:32,353 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 7 [2025-03-08 22:38:32,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:32,353 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2025-03-08 22:38:32,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-08 22:38:32,353 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2025-03-08 22:38:32,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:38:32,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:32,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:32,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:38:32,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:32,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:32,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1574209604, now seen corresponding path program 1 times [2025-03-08 22:38:32,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:32,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354388155] [2025-03-08 22:38:32,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:32,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:32,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:38:32,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:38:32,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:32,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:32,446 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-08 22:38:32,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:32,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354388155] [2025-03-08 22:38:32,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354388155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:32,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:32,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:38:32,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549508469] [2025-03-08 22:38:32,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:32,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:38:32,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:32,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:38:32,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:38:32,449 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-08 22:38:32,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:32,481 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-03-08 22:38:32,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:38:32,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2025-03-08 22:38:32,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:32,482 INFO L225 Difference]: With dead ends: 32 [2025-03-08 22:38:32,482 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 22:38:32,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:38:32,483 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:32,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 44 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:32,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 22:38:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-08 22:38:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 31 states have internal predecessors, (38), 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-08 22:38:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-03-08 22:38:32,486 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 7 [2025-03-08 22:38:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:32,486 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-03-08 22:38:32,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-08 22:38:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-03-08 22:38:32,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:38:32,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:32,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:32,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:38:32,487 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:32,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:32,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1574209605, now seen corresponding path program 1 times [2025-03-08 22:38:32,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:32,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796253595] [2025-03-08 22:38:32,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:32,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:32,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:38:32,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:38:32,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:32,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:32,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:32,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:32,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796253595] [2025-03-08 22:38:32,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796253595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:32,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:32,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:38:32,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764723039] [2025-03-08 22:38:32,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:32,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:38:32,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:32,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:38:32,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:38:32,661 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-08 22:38:32,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:32,699 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-03-08 22:38:32,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:38:32,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-03-08 22:38:32,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:32,700 INFO L225 Difference]: With dead ends: 33 [2025-03-08 22:38:32,700 INFO L226 Difference]: Without dead ends: 33 [2025-03-08 22:38:32,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:38:32,700 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:32,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 74 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-08 22:38:32,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-08 22:38:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.625) internal successors, (39), 32 states have internal predecessors, (39), 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-08 22:38:32,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-03-08 22:38:32,703 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 7 [2025-03-08 22:38:32,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:32,705 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-03-08 22:38:32,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-08 22:38:32,705 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-03-08 22:38:32,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:38:32,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:32,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:32,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:38:32,706 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:32,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:32,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1575133286, now seen corresponding path program 1 times [2025-03-08 22:38:32,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:32,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283613720] [2025-03-08 22:38:32,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:32,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:32,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:38:32,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:38:32,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:32,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:32,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:32,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283613720] [2025-03-08 22:38:32,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283613720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:32,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:32,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:38:32,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094435310] [2025-03-08 22:38:32,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:32,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:38:32,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:32,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:38:32,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:38:32,839 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-08 22:38:32,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:32,896 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2025-03-08 22:38:32,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:38:32,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2025-03-08 22:38:32,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:32,896 INFO L225 Difference]: With dead ends: 36 [2025-03-08 22:38:32,896 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 22:38:32,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:38:32,897 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:32,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 64 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:32,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 22:38:32,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2025-03-08 22:38:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 34 states have internal predecessors, (42), 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-08 22:38:32,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-03-08 22:38:32,899 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 7 [2025-03-08 22:38:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:32,899 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-08 22:38:32,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-08 22:38:32,900 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-03-08 22:38:32,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 22:38:32,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:32,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:32,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:38:32,900 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:32,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:32,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1575133126, now seen corresponding path program 1 times [2025-03-08 22:38:32,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:32,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172924880] [2025-03-08 22:38:32,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:32,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:32,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 22:38:32,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 22:38:32,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:32,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:33,023 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-08 22:38:33,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:33,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172924880] [2025-03-08 22:38:33,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172924880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:33,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:33,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:38:33,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099002460] [2025-03-08 22:38:33,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:33,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:38:33,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:33,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:38:33,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:38:33,024 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-08 22:38:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:33,056 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2025-03-08 22:38:33,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:38:33,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2025-03-08 22:38:33,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:33,057 INFO L225 Difference]: With dead ends: 37 [2025-03-08 22:38:33,057 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 22:38:33,057 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-08 22:38:33,058 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:33,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 52 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:33,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 22:38:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-03-08 22:38:33,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 34 states have internal predecessors, (42), 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-08 22:38:33,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2025-03-08 22:38:33,060 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 7 [2025-03-08 22:38:33,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:33,060 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2025-03-08 22:38:33,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-08 22:38:33,061 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2025-03-08 22:38:33,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:38:33,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:33,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:33,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:38:33,061 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:33,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:33,062 INFO L85 PathProgramCache]: Analyzing trace with hash 530403701, now seen corresponding path program 1 times [2025-03-08 22:38:33,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:33,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814487584] [2025-03-08 22:38:33,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:33,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:33,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:38:33,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:38:33,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:33,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:33,118 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-08 22:38:33,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:33,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814487584] [2025-03-08 22:38:33,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814487584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:33,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:33,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:38:33,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572217390] [2025-03-08 22:38:33,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:33,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:38:33,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:33,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:38:33,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:38:33,120 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-08 22:38:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:33,187 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-03-08 22:38:33,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:38:33,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2025-03-08 22:38:33,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:33,188 INFO L225 Difference]: With dead ends: 34 [2025-03-08 22:38:33,189 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 22:38:33,189 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-08 22:38:33,189 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:33,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 54 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:38:33,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 22:38:33,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-08 22:38:33,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 33 states have internal predecessors, (41), 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-08 22:38:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2025-03-08 22:38:33,191 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 10 [2025-03-08 22:38:33,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:33,191 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2025-03-08 22:38:33,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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-08 22:38:33,194 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2025-03-08 22:38:33,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:38:33,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:33,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:33,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:38:33,195 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:33,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:33,195 INFO L85 PathProgramCache]: Analyzing trace with hash 530403702, now seen corresponding path program 1 times [2025-03-08 22:38:33,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:33,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387808506] [2025-03-08 22:38:33,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:33,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:33,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:38:33,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:38:33,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:33,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:33,310 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-08 22:38:33,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:33,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387808506] [2025-03-08 22:38:33,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387808506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:33,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:33,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:38:33,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059759911] [2025-03-08 22:38:33,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:33,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:38:33,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:33,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:38:33,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:38:33,312 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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-08 22:38:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:33,373 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2025-03-08 22:38:33,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:38:33,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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 10 [2025-03-08 22:38:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:33,374 INFO L225 Difference]: With dead ends: 38 [2025-03-08 22:38:33,374 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 22:38:33,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:38:33,375 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:33,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 107 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:38:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 22:38:33,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-03-08 22:38:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 35 states have internal predecessors, (44), 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-08 22:38:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2025-03-08 22:38:33,380 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 10 [2025-03-08 22:38:33,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:33,380 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2025-03-08 22:38:33,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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-08 22:38:33,380 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2025-03-08 22:38:33,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:38:33,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:33,380 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:33,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:38:33,380 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:33,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:33,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2016981542, now seen corresponding path program 1 times [2025-03-08 22:38:33,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:33,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096113634] [2025-03-08 22:38:33,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:33,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:33,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:38:33,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:38:33,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:33,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:33,586 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-08 22:38:33,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:33,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096113634] [2025-03-08 22:38:33,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096113634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:33,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298223329] [2025-03-08 22:38:33,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:33,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:33,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:33,590 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-08 22:38:33,591 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-08 22:38:33,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:38:33,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:38:33,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:33,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:33,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 22:38:33,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:33,716 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 13 treesize of output 7 [2025-03-08 22:38:33,724 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-08 22:38:33,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:33,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:33,963 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-08 22:38:33,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298223329] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:33,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:33,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-03-08 22:38:33,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478846608] [2025-03-08 22:38:33,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:33,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 22:38:33,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:33,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 22:38:33,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-08 22:38:33,967 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 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-08 22:38:34,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:34,123 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2025-03-08 22:38:34,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:38:34,125 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 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 10 [2025-03-08 22:38:34,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:34,125 INFO L225 Difference]: With dead ends: 37 [2025-03-08 22:38:34,125 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 22:38:34,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:38:34,126 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:34,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 138 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:38:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 22:38:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2025-03-08 22:38:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 33 states have internal predecessors, (42), 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-08 22:38:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2025-03-08 22:38:34,131 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 10 [2025-03-08 22:38:34,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:34,131 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2025-03-08 22:38:34,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 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-08 22:38:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2025-03-08 22:38:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 22:38:34,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:34,131 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:34,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 22:38:34,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:34,332 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:34,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:34,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2016981702, now seen corresponding path program 1 times [2025-03-08 22:38:34,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:34,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576268778] [2025-03-08 22:38:34,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:34,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:34,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 22:38:34,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 22:38:34,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:34,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:34,530 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-08 22:38:34,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:34,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576268778] [2025-03-08 22:38:34,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576268778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:34,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:34,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:38:34,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19959805] [2025-03-08 22:38:34,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:34,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:38:34,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:34,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:38:34,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:38:34,532 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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-08 22:38:34,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:34,570 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2025-03-08 22:38:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:38:34,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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 10 [2025-03-08 22:38:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:34,571 INFO L225 Difference]: With dead ends: 33 [2025-03-08 22:38:34,571 INFO L226 Difference]: Without dead ends: 33 [2025-03-08 22:38:34,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:38:34,571 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:34,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:34,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-08 22:38:34,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2025-03-08 22:38:34,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.52) internal successors, (38), 30 states have internal predecessors, (38), 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-08 22:38:34,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-03-08 22:38:34,573 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 10 [2025-03-08 22:38:34,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:34,573 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-03-08 22:38:34,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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-08 22:38:34,573 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-03-08 22:38:34,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:38:34,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:34,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:34,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:38:34,573 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:34,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:34,574 INFO L85 PathProgramCache]: Analyzing trace with hash -737354465, now seen corresponding path program 1 times [2025-03-08 22:38:34,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:34,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327047059] [2025-03-08 22:38:34,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:34,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:34,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:38:34,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:38:34,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:34,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:34,655 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-08 22:38:34,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:34,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327047059] [2025-03-08 22:38:34,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327047059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:34,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:34,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:38:34,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169251788] [2025-03-08 22:38:34,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:34,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:38:34,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:34,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:38:34,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:38:34,656 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-08 22:38:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:34,692 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2025-03-08 22:38:34,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:38:34,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-08 22:38:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:34,693 INFO L225 Difference]: With dead ends: 32 [2025-03-08 22:38:34,693 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 22:38:34,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:38:34,695 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:34,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 70 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:34,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 22:38:34,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-03-08 22:38:34,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.48) internal successors, (37), 29 states have internal predecessors, (37), 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-08 22:38:34,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-03-08 22:38:34,697 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 11 [2025-03-08 22:38:34,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:34,697 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-03-08 22:38:34,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-08 22:38:34,697 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2025-03-08 22:38:34,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:38:34,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:34,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:34,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:38:34,698 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:34,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:34,698 INFO L85 PathProgramCache]: Analyzing trace with hash -737354464, now seen corresponding path program 1 times [2025-03-08 22:38:34,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:34,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937863227] [2025-03-08 22:38:34,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:34,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:34,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:38:34,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:38:34,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:34,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:34,816 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-08 22:38:34,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:34,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937863227] [2025-03-08 22:38:34,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937863227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:34,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:34,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:38:34,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431612781] [2025-03-08 22:38:34,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:34,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:38:34,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:34,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:38:34,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:38:34,817 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-08 22:38:34,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:34,846 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2025-03-08 22:38:34,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:38:34,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-08 22:38:34,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:34,847 INFO L225 Difference]: With dead ends: 43 [2025-03-08 22:38:34,847 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 22:38:34,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:38:34,848 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:34,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 78 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:34,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 22:38:34,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2025-03-08 22:38:34,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 40 states have internal predecessors, (50), 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-08 22:38:34,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2025-03-08 22:38:34,850 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 11 [2025-03-08 22:38:34,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:34,850 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2025-03-08 22:38:34,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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-08 22:38:34,850 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2025-03-08 22:38:34,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 22:38:34,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:34,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:34,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:38:34,850 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:34,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:34,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1005455871, now seen corresponding path program 1 times [2025-03-08 22:38:34,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:34,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440131650] [2025-03-08 22:38:34,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:34,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:34,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 22:38:34,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 22:38:34,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:34,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:35,022 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-08 22:38:35,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:35,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440131650] [2025-03-08 22:38:35,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440131650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:35,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:35,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 22:38:35,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919464619] [2025-03-08 22:38:35,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:35,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:38:35,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:35,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:38:35,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:38:35,024 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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-08 22:38:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:35,058 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2025-03-08 22:38:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:38:35,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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-08 22:38:35,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:35,059 INFO L225 Difference]: With dead ends: 44 [2025-03-08 22:38:35,059 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 22:38:35,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:38:35,060 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:35,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 80 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:35,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 22:38:35,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2025-03-08 22:38:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 30 states have internal predecessors, (38), 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-08 22:38:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-03-08 22:38:35,063 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 11 [2025-03-08 22:38:35,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:35,063 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-03-08 22:38:35,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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-08 22:38:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-03-08 22:38:35,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 22:38:35,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:35,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:35,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:38:35,063 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:35,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:35,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1383137023, now seen corresponding path program 1 times [2025-03-08 22:38:35,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:35,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020007627] [2025-03-08 22:38:35,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:35,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:35,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 22:38:35,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 22:38:35,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:35,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:35,094 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-08 22:38:35,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:35,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020007627] [2025-03-08 22:38:35,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020007627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:35,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:35,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:38:35,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514432188] [2025-03-08 22:38:35,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:35,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:38:35,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:35,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:38:35,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:38:35,096 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-08 22:38:35,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:35,107 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2025-03-08 22:38:35,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:38:35,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2025-03-08 22:38:35,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:35,108 INFO L225 Difference]: With dead ends: 31 [2025-03-08 22:38:35,108 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 22:38:35,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:38:35,108 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:35,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 70 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:35,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 22:38:35,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-08 22:38:35,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 30 states have internal predecessors, (37), 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-08 22:38:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2025-03-08 22:38:35,111 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 12 [2025-03-08 22:38:35,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:35,112 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2025-03-08 22:38:35,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-08 22:38:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2025-03-08 22:38:35,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:38:35,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:35,112 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:35,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:38:35,112 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:35,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:35,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2064127758, now seen corresponding path program 1 times [2025-03-08 22:38:35,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:35,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232301421] [2025-03-08 22:38:35,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:35,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:35,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:38:35,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:38:35,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:35,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:35,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:35,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232301421] [2025-03-08 22:38:35,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232301421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:35,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:35,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:38:35,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103155024] [2025-03-08 22:38:35,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:35,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:38:35,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:35,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:38:35,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:38:35,157 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:35,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:35,170 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2025-03-08 22:38:35,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:38:35,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 22:38:35,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:35,172 INFO L225 Difference]: With dead ends: 44 [2025-03-08 22:38:35,172 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 22:38:35,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:38:35,172 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:35,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 71 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:35,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 22:38:35,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-08 22:38:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 43 states have internal predecessors, (52), 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-08 22:38:35,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-03-08 22:38:35,174 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 14 [2025-03-08 22:38:35,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:35,175 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-03-08 22:38:35,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:35,175 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-03-08 22:38:35,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:38:35,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:35,175 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:35,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:38:35,175 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:35,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:35,176 INFO L85 PathProgramCache]: Analyzing trace with hash 433888179, now seen corresponding path program 1 times [2025-03-08 22:38:35,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:35,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557700629] [2025-03-08 22:38:35,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:35,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:35,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:38:35,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:38:35,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:35,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:35,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:35,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557700629] [2025-03-08 22:38:35,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557700629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:35,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:35,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:38:35,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441318475] [2025-03-08 22:38:35,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:35,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:38:35,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:35,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:38:35,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:38:35,304 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:35,344 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2025-03-08 22:38:35,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 22:38:35,344 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 22:38:35,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:35,345 INFO L225 Difference]: With dead ends: 56 [2025-03-08 22:38:35,346 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 22:38:35,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:38:35,347 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:35,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 120 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:35,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 22:38:35,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2025-03-08 22:38:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 47 states have internal predecessors, (56), 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-08 22:38:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2025-03-08 22:38:35,351 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 14 [2025-03-08 22:38:35,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:35,351 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2025-03-08 22:38:35,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:35,351 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2025-03-08 22:38:35,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:38:35,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:35,352 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:35,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:38:35,352 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:35,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:35,352 INFO L85 PathProgramCache]: Analyzing trace with hash 562970898, now seen corresponding path program 1 times [2025-03-08 22:38:35,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:35,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497982604] [2025-03-08 22:38:35,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:35,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:35,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:38:35,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:38:35,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:35,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:35,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:35,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497982604] [2025-03-08 22:38:35,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497982604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:35,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:35,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 22:38:35,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915132797] [2025-03-08 22:38:35,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:35,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 22:38:35,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:35,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 22:38:35,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:38:35,510 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:35,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:35,564 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2025-03-08 22:38:35,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:38:35,565 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 22:38:35,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:35,565 INFO L225 Difference]: With dead ends: 66 [2025-03-08 22:38:35,565 INFO L226 Difference]: Without dead ends: 66 [2025-03-08 22:38:35,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 22:38:35,566 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:35,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 106 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:38:35,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-08 22:38:35,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2025-03-08 22:38:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 49 states have internal predecessors, (60), 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-08 22:38:35,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2025-03-08 22:38:35,569 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 14 [2025-03-08 22:38:35,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:35,570 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2025-03-08 22:38:35,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:35,570 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2025-03-08 22:38:35,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 22:38:35,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:35,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:35,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:38:35,572 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:35,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:35,572 INFO L85 PathProgramCache]: Analyzing trace with hash 436509239, now seen corresponding path program 1 times [2025-03-08 22:38:35,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:35,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188568949] [2025-03-08 22:38:35,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:35,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:35,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 22:38:35,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 22:38:35,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:35,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:35,623 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-08 22:38:35,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:35,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188568949] [2025-03-08 22:38:35,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188568949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:35,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:35,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:38:35,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974311231] [2025-03-08 22:38:35,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:35,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:38:35,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:35,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:38:35,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:38:35,624 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-08 22:38:35,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:35,676 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2025-03-08 22:38:35,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:38:35,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-08 22:38:35,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:35,677 INFO L225 Difference]: With dead ends: 51 [2025-03-08 22:38:35,677 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 22:38:35,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:38:35,677 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:35,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 78 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:35,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 22:38:35,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-03-08 22:38:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 48 states have internal predecessors, (59), 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-08 22:38:35,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2025-03-08 22:38:35,679 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 15 [2025-03-08 22:38:35,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:35,679 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2025-03-08 22:38:35,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-08 22:38:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2025-03-08 22:38:35,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 22:38:35,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:35,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:35,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:38:35,680 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:35,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:35,680 INFO L85 PathProgramCache]: Analyzing trace with hash 436509240, now seen corresponding path program 1 times [2025-03-08 22:38:35,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:35,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806440712] [2025-03-08 22:38:35,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:35,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:35,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 22:38:35,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 22:38:35,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:35,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:35,756 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-08 22:38:35,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:35,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806440712] [2025-03-08 22:38:35,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806440712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:35,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:35,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 22:38:35,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707420136] [2025-03-08 22:38:35,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:35,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 22:38:35,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:35,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 22:38:35,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:38:35,758 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-08 22:38:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:35,785 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2025-03-08 22:38:35,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 22:38:35,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-08 22:38:35,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:35,786 INFO L225 Difference]: With dead ends: 59 [2025-03-08 22:38:35,786 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 22:38:35,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:38:35,787 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:35,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 124 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:35,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 22:38:35,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-08 22:38:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 58 states have internal predecessors, (69), 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-08 22:38:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2025-03-08 22:38:35,789 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 15 [2025-03-08 22:38:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:35,789 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2025-03-08 22:38:35,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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-08 22:38:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2025-03-08 22:38:35,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 22:38:35,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:35,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:35,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:38:35,790 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:35,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:35,790 INFO L85 PathProgramCache]: Analyzing trace with hash 565591959, now seen corresponding path program 1 times [2025-03-08 22:38:35,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:35,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157187298] [2025-03-08 22:38:35,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:35,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:35,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 22:38:35,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 22:38:35,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:35,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:36,049 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-08 22:38:36,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:36,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157187298] [2025-03-08 22:38:36,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157187298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:36,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:36,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 22:38:36,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853728663] [2025-03-08 22:38:36,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:36,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 22:38:36,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:36,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 22:38:36,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 22:38:36,050 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 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-08 22:38:36,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:36,185 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2025-03-08 22:38:36,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:38:36,185 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 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-08 22:38:36,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:36,186 INFO L225 Difference]: With dead ends: 62 [2025-03-08 22:38:36,186 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 22:38:36,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 22:38:36,186 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:36,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 91 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:38:36,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 22:38:36,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-08 22:38:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 61 states have internal predecessors, (73), 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-08 22:38:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2025-03-08 22:38:36,188 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 15 [2025-03-08 22:38:36,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:36,188 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2025-03-08 22:38:36,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 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-08 22:38:36,188 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2025-03-08 22:38:36,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:38:36,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:36,188 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:36,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:38:36,190 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:36,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:36,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1421447917, now seen corresponding path program 1 times [2025-03-08 22:38:36,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:36,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980219007] [2025-03-08 22:38:36,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:36,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:36,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:38:36,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:38:36,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:36,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:36,258 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-08 22:38:36,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:36,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980219007] [2025-03-08 22:38:36,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980219007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:38:36,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:38:36,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:38:36,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183076677] [2025-03-08 22:38:36,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:38:36,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:38:36,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:36,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:38:36,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:38:36,259 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-08 22:38:36,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:36,272 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2025-03-08 22:38:36,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 22:38:36,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-08 22:38:36,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:36,272 INFO L225 Difference]: With dead ends: 61 [2025-03-08 22:38:36,272 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 22:38:36,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:38:36,273 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:36,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:38:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 22:38:36,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-08 22:38:36,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 35 states have internal predecessors, (40), 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-08 22:38:36,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-03-08 22:38:36,274 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 17 [2025-03-08 22:38:36,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:36,274 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-03-08 22:38:36,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-08 22:38:36,274 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-03-08 22:38:36,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 22:38:36,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:36,274 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:36,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:38:36,274 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:36,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:36,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1501454332, now seen corresponding path program 1 times [2025-03-08 22:38:36,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:36,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532929040] [2025-03-08 22:38:36,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:36,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:36,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:38:36,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:38:36,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:36,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:36,470 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-08 22:38:36,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:36,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532929040] [2025-03-08 22:38:36,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532929040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:36,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907322996] [2025-03-08 22:38:36,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:36,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:36,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:36,473 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-08 22:38:36,474 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-08 22:38:36,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 22:38:36,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 22:38:36,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:36,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:36,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 22:38:36,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:36,610 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-08 22:38:36,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:36,722 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 5 treesize of output 3 [2025-03-08 22:38:36,742 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-08 22:38:36,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907322996] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:36,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:36,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-03-08 22:38:36,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541279115] [2025-03-08 22:38:36,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:36,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 22:38:36,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:36,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 22:38:36,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:38:36,743 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:36,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:36,934 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-03-08 22:38:36,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:38:36,934 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 22:38:36,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:36,935 INFO L225 Difference]: With dead ends: 48 [2025-03-08 22:38:36,935 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 22:38:36,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-03-08 22:38:36,935 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:36,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 178 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:38:36,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 22:38:36,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2025-03-08 22:38:36,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 38 states have internal predecessors, (44), 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-08 22:38:36,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-03-08 22:38:36,937 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 17 [2025-03-08 22:38:36,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:36,937 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-03-08 22:38:36,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:36,937 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-03-08 22:38:36,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:38:36,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:36,938 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:36,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 22:38:37,138 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,SelfDestructingSolverStorable20 [2025-03-08 22:38:37,138 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:37,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:37,139 INFO L85 PathProgramCache]: Analyzing trace with hash 393302645, now seen corresponding path program 1 times [2025-03-08 22:38:37,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:37,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667615829] [2025-03-08 22:38:37,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:37,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:37,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:38:37,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:38:37,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:37,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:37,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:37,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:37,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667615829] [2025-03-08 22:38:37,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667615829] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:37,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684194095] [2025-03-08 22:38:37,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:37,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:37,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:37,538 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-08 22:38:37,540 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-08 22:38:37,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:38:37,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:38:37,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:37,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:37,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-08 22:38:37,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:37,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:38:37,639 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 13 treesize of output 7 [2025-03-08 22:38:37,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-08 22:38:38,125 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-08 22:38:38,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:38,496 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:38:38,538 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-08 22:38:38,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684194095] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:38,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:38,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2025-03-08 22:38:38,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774159398] [2025-03-08 22:38:38,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:38,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-08 22:38:38,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:38,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-08 22:38:38,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1123, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 22:38:38,539 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 36 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 36 states have internal predecessors, (52), 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-08 22:38:38,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:38,973 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-03-08 22:38:38,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 22:38:38,974 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 36 states have internal predecessors, (52), 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 18 [2025-03-08 22:38:38,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:38,974 INFO L225 Difference]: With dead ends: 44 [2025-03-08 22:38:38,974 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 22:38:38,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=214, Invalid=1766, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 22:38:38,976 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:38,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 152 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:38:38,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 22:38:38,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-08 22:38:38,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 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-08 22:38:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2025-03-08 22:38:38,977 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2025-03-08 22:38:38,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:38,978 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2025-03-08 22:38:38,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 36 states have internal predecessors, (52), 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-08 22:38:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2025-03-08 22:38:38,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 22:38:38,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:38,978 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:38,984 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-08 22:38:39,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:39,183 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:39,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:39,183 INFO L85 PathProgramCache]: Analyzing trace with hash -699556006, now seen corresponding path program 1 times [2025-03-08 22:38:39,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:39,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601041330] [2025-03-08 22:38:39,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:39,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:39,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:38:39,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:38:39,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:39,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:38:39,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:39,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601041330] [2025-03-08 22:38:39,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601041330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:39,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102792384] [2025-03-08 22:38:39,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:38:39,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:39,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:39,386 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-08 22:38:39,387 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-08 22:38:39,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 22:38:39,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 22:38:39,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:38:39,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:39,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-08 22:38:39,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:39,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 22:38:39,463 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 13 treesize of output 7 [2025-03-08 22:38:39,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-08 22:38:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:38:39,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:39,811 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 22:38:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:38:39,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102792384] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:39,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:39,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-08 22:38:39,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572876303] [2025-03-08 22:38:39,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:39,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 22:38:39,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:39,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 22:38:39,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2025-03-08 22:38:39,842 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 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-08 22:38:39,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:39,947 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2025-03-08 22:38:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 22:38:39,948 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 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 18 [2025-03-08 22:38:39,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:39,948 INFO L225 Difference]: With dead ends: 23 [2025-03-08 22:38:39,948 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 22:38:39,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2025-03-08 22:38:39,948 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 10 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:39,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 59 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:38:39,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 22:38:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-03-08 22:38:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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-08 22:38:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2025-03-08 22:38:39,949 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 18 [2025-03-08 22:38:39,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:39,949 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2025-03-08 22:38:39,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 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-08 22:38:39,950 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2025-03-08 22:38:39,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 22:38:39,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:39,950 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:39,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 22:38:40,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:40,151 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:40,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:40,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1291697032, now seen corresponding path program 2 times [2025-03-08 22:38:40,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:40,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22504086] [2025-03-08 22:38:40,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:38:40,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:40,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-08 22:38:40,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 22:38:40,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:38:40,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:40,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:40,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22504086] [2025-03-08 22:38:40,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22504086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:40,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225107372] [2025-03-08 22:38:40,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:38:40,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:40,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:40,418 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-08 22:38:40,419 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-08 22:38:40,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-08 22:38:40,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 22:38:40,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:38:40,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:40,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 22:38:40,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:40,532 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 13 treesize of output 9 [2025-03-08 22:38:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:40,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:40,595 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 13 [2025-03-08 22:38:40,597 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 16 treesize of output 12 [2025-03-08 22:38:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:40,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225107372] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:40,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:40,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 21 [2025-03-08 22:38:40,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49118138] [2025-03-08 22:38:40,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:40,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 22:38:40,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:40,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 22:38:40,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-03-08 22:38:40,637 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 21 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 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-08 22:38:40,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:40,791 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2025-03-08 22:38:40,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 22:38:40,792 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 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-08 22:38:40,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:40,792 INFO L225 Difference]: With dead ends: 37 [2025-03-08 22:38:40,792 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 22:38:40,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2025-03-08 22:38:40,792 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:40,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:38:40,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 22:38:40,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-03-08 22:38:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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-08 22:38:40,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2025-03-08 22:38:40,793 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2025-03-08 22:38:40,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:40,793 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2025-03-08 22:38:40,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 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-08 22:38:40,793 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2025-03-08 22:38:40,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 22:38:40,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:40,794 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:40,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 22:38:40,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-08 22:38:40,994 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:40,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:40,995 INFO L85 PathProgramCache]: Analyzing trace with hash 69691982, now seen corresponding path program 3 times [2025-03-08 22:38:40,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:40,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996289930] [2025-03-08 22:38:40,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:38:40,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:41,004 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-03-08 22:38:41,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:38:41,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 22:38:41,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:41,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:41,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996289930] [2025-03-08 22:38:41,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996289930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:41,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780807980] [2025-03-08 22:38:41,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:38:41,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:41,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:41,264 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-08 22:38:41,265 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-08 22:38:41,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-03-08 22:38:41,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 22:38:41,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 22:38:41,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:41,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 22:38:41,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:41,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:41,557 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 21 treesize of output 17 [2025-03-08 22:38:41,636 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:38:41,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780807980] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:41,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:41,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2025-03-08 22:38:41,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293813757] [2025-03-08 22:38:41,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:41,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 22:38:41,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:41,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 22:38:41,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2025-03-08 22:38:41,640 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 25 states have internal predecessors, (58), 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-08 22:38:41,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:41,775 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2025-03-08 22:38:41,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 22:38:41,776 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 25 states have internal predecessors, (58), 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 24 [2025-03-08 22:38:41,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:41,776 INFO L225 Difference]: With dead ends: 29 [2025-03-08 22:38:41,776 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 22:38:41,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2025-03-08 22:38:41,777 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:41,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 66 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:38:41,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 22:38:41,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-08 22:38:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 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-08 22:38:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2025-03-08 22:38:41,778 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2025-03-08 22:38:41,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:41,778 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2025-03-08 22:38:41,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 25 states have internal predecessors, (58), 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-08 22:38:41,779 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2025-03-08 22:38:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 22:38:41,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:38:41,779 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:41,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 22:38:41,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:41,981 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2025-03-08 22:38:41,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:38:41,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1922684362, now seen corresponding path program 4 times [2025-03-08 22:38:41,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:38:41,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113790541] [2025-03-08 22:38:41,982 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 22:38:41,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:38:41,990 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-08 22:38:42,001 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-08 22:38:42,002 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 22:38:42,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:42,474 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:38:42,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:38:42,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113790541] [2025-03-08 22:38:42,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113790541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:38:42,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867333070] [2025-03-08 22:38:42,474 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 22:38:42,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:42,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:38:42,476 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:38:42,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 22:38:42,525 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-08 22:38:42,546 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-03-08 22:38:42,546 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 22:38:42,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:38:42,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-08 22:38:42,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:38:42,576 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 14 treesize of output 10 [2025-03-08 22:38:43,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 22:38:43,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 122 [2025-03-08 22:38:43,458 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:38:43,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:38:43,885 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 44 treesize of output 38 [2025-03-08 22:38:43,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2025-03-08 22:38:43,900 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 5 treesize of output 3 [2025-03-08 22:38:43,925 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:38:43,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867333070] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:38:43,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:38:43,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 36 [2025-03-08 22:38:43,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836360331] [2025-03-08 22:38:43,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:38:43,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-08 22:38:43,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:38:43,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-08 22:38:43,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 22:38:43,927 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 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-08 22:38:44,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:38:44,248 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2025-03-08 22:38:44,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 22:38:44,248 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 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-08 22:38:44,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:38:44,248 INFO L225 Difference]: With dead ends: 28 [2025-03-08 22:38:44,248 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 22:38:44,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=227, Invalid=1333, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 22:38:44,249 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 22:38:44,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 22:38:44,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 22:38:44,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 22:38:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:38:44,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 22:38:44,249 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2025-03-08 22:38:44,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:38:44,249 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 22:38:44,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 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-08 22:38:44,250 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 22:38:44,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 22:38:44,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (10 of 11 remaining) [2025-03-08 22:38:44,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2025-03-08 22:38:44,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2025-03-08 22:38:44,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 11 remaining) [2025-03-08 22:38:44,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 11 remaining) [2025-03-08 22:38:44,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2025-03-08 22:38:44,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2025-03-08 22:38:44,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 11 remaining) [2025-03-08 22:38:44,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2025-03-08 22:38:44,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 11 remaining) [2025-03-08 22:38:44,252 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 11 remaining) [2025-03-08 22:38:44,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 22:38:44,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:38:44,455 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:38:44,456 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:38:44,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:38:44 BoogieIcfgContainer [2025-03-08 22:38:44,458 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:38:44,458 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:38:44,458 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:38:44,458 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:38:44,459 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:38:31" (3/4) ... [2025-03-08 22:38:44,460 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:38:44,467 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-08 22:38:44,467 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 22:38:44,467 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-08 22:38:44,467 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:38:44,523 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:38:44,523 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:38:44,523 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:38:44,524 INFO L158 Benchmark]: Toolchain (without parser) took 13136.40ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 111.5MB in the beginning and 192.8MB in the end (delta: -81.3MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2025-03-08 22:38:44,524 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 226.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:38:44,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.98ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 94.6MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:38:44,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.37ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 93.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:38:44,524 INFO L158 Benchmark]: Boogie Preprocessor took 28.29ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:38:44,524 INFO L158 Benchmark]: IcfgBuilder took 301.08ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 76.1MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:38:44,524 INFO L158 Benchmark]: TraceAbstraction took 12481.19ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 75.5MB in the beginning and 197.6MB in the end (delta: -122.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2025-03-08 22:38:44,525 INFO L158 Benchmark]: Witness Printer took 65.08ms. Allocated memory is still 268.4MB. Free memory was 197.6MB in the beginning and 192.8MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:38:44,525 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 226.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.98ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 94.6MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.37ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 93.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.29ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 301.08ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 76.1MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12481.19ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 75.5MB in the beginning and 197.6MB in the end (delta: -122.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Witness Printer took 65.08ms. Allocated memory is still 268.4MB. Free memory was 197.6MB in the beginning and 192.8MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 532]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 39 edges, 11 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 26, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 208 mSDsluCounter, 2230 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1699 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2595 IncrementalHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 531 mSDtfsCounter, 2595 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 471 GetRequests, 194 SyntacticMatches, 5 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=19, InterpolantAutomatonStates: 205, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 67 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 486 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 582 ConstructedInterpolants, 13 QuantifiedInterpolants, 6794 SizeOfPredicates, 44 NumberOfNonLiveVariables, 1087 ConjunctsInSsa, 294 ConjunctsInUnsatCore, 40 InterpolantComputations, 19 PerfectInterpolantSequences, 51/178 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 22:38:44,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE