./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-dietlibc/strlcpy.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/termination-dietlibc/strlcpy.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash c2292e98244edafad4d7dc9607780b552ab07213ed34494d4f4d17ad8279c4d0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:19:32,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:19:32,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-17 00:19:32,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:19:32,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:19:32,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:19:32,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:19:32,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:19:32,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:19:32,496 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:19:32,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:19:32,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:19:32,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:19:32,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:19:32,499 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:19:32,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:19:32,499 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:19:32,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:19:32,500 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:19:32,500 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:19:32,503 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:19:32,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:19:32,503 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:19:32,504 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:19:32,504 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:19:32,504 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:19:32,504 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:19:32,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:19:32,505 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:19:32,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:19:32,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:19:32,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:19:32,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:19:32,505 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:19:32,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:19:32,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:19:32,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:19:32,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:19:32,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:19:32,506 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2292e98244edafad4d7dc9607780b552ab07213ed34494d4f4d17ad8279c4d0 [2024-11-17 00:19:32,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:19:32,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:19:32,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:19:32,723 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:19:32,724 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:19:32,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strlcpy.i [2024-11-17 00:19:34,093 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:19:34,266 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:19:34,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strlcpy.i [2024-11-17 00:19:34,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1b5f9c19/4e32c9afbe124c20b00394df0ef4156e/FLAG9886a4477 [2024-11-17 00:19:34,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1b5f9c19/4e32c9afbe124c20b00394df0ef4156e [2024-11-17 00:19:34,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:19:34,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:19:34,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:19:34,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:19:34,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:19:34,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:19:34" (1/1) ... [2024-11-17 00:19:34,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7529cde3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:34, skipping insertion in model container [2024-11-17 00:19:34,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:19:34" (1/1) ... [2024-11-17 00:19:34,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:19:34,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:19:34,616 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:19:34,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:19:34,690 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:19:34,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:34 WrapperNode [2024-11-17 00:19:34,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:19:34,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:19:34,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:19:34,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:19:34,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:34" (1/1) ... [2024-11-17 00:19:34,720 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:34" (1/1) ... [2024-11-17 00:19:34,739 INFO L138 Inliner]: procedures = 113, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2024-11-17 00:19:34,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:19:34,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:19:34,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:19:34,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:19:34,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:34" (1/1) ... [2024-11-17 00:19:34,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:34" (1/1) ... [2024-11-17 00:19:34,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:34" (1/1) ... [2024-11-17 00:19:34,774 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 3 writes are split as follows [0, 3]. [2024-11-17 00:19:34,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:34" (1/1) ... [2024-11-17 00:19:34,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:34" (1/1) ... [2024-11-17 00:19:34,782 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:34" (1/1) ... [2024-11-17 00:19:34,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:34" (1/1) ... [2024-11-17 00:19:34,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:34" (1/1) ... [2024-11-17 00:19:34,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:34" (1/1) ... [2024-11-17 00:19:34,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:19:34,788 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:19:34,789 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:19:34,789 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:19:34,790 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:34" (1/1) ... [2024-11-17 00:19:34,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:19:34,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:19:34,852 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) [2024-11-17 00:19:34,864 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 [2024-11-17 00:19:34,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:19:34,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:19:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:19:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:19:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:19:34,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:19:34,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:19:34,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:19:34,999 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:19:35,004 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:19:35,169 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L536: havoc main_#t~ret14#1;call ULTIMATE.dealloc(main_#t~malloc11#1.base, main_#t~malloc11#1.offset);havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call ULTIMATE.dealloc(main_#t~malloc13#1.base, main_#t~malloc13#1.offset);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset; [2024-11-17 00:19:35,183 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-11-17 00:19:35,184 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:19:35,200 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:19:35,201 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:19:35,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:19:35 BoogieIcfgContainer [2024-11-17 00:19:35,201 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:19:35,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:19:35,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:19:35,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:19:35,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:19:34" (1/3) ... [2024-11-17 00:19:35,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ded896a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:19:35, skipping insertion in model container [2024-11-17 00:19:35,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:19:34" (2/3) ... [2024-11-17 00:19:35,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ded896a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:19:35, skipping insertion in model container [2024-11-17 00:19:35,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:19:35" (3/3) ... [2024-11-17 00:19:35,210 INFO L112 eAbstractionObserver]: Analyzing ICFG strlcpy.i [2024-11-17 00:19:35,225 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:19:35,226 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-11-17 00:19:35,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:19:35,271 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;@467dd82e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:19:35,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-17 00:19:35,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 25 states have (on average 1.88) internal successors, (47), 36 states have internal predecessors, (47), 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) [2024-11-17 00:19:35,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 00:19:35,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:35,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 00:19:35,283 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)] === [2024-11-17 00:19:35,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:35,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2646394, now seen corresponding path program 1 times [2024-11-17 00:19:35,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:35,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459261852] [2024-11-17 00:19:35,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:35,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:35,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:35,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459261852] [2024-11-17 00:19:35,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459261852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:35,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:35,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:19:35,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131959947] [2024-11-17 00:19:35,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:35,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:19:35,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:35,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:19:35,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:19:35,575 INFO L87 Difference]: Start difference. First operand has 37 states, 25 states have (on average 1.88) internal successors, (47), 36 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-17 00:19:35,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:35,651 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-11-17 00:19:35,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:19:35,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-17 00:19:35,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:35,659 INFO L225 Difference]: With dead ends: 36 [2024-11-17 00:19:35,659 INFO L226 Difference]: Without dead ends: 33 [2024-11-17 00:19:35,661 INFO L431 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 [2024-11-17 00:19:35,665 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:35,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 64 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-17 00:19:35,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-17 00:19:35,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 32 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) [2024-11-17 00:19:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-11-17 00:19:35,692 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 4 [2024-11-17 00:19:35,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:35,693 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-11-17 00:19:35,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-17 00:19:35,693 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-11-17 00:19:35,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 00:19:35,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:35,694 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 00:19:35,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:19:35,694 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-17 00:19:35,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:35,695 INFO L85 PathProgramCache]: Analyzing trace with hash 2646395, now seen corresponding path program 1 times [2024-11-17 00:19:35,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:35,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481249695] [2024-11-17 00:19:35,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:35,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:35,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:35,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481249695] [2024-11-17 00:19:35,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481249695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:35,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:35,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:19:35,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312985886] [2024-11-17 00:19:35,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:35,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:19:35,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:35,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:19:35,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:19:35,842 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2024-11-17 00:19:35,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:35,877 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-11-17 00:19:35,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:19:35,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2024-11-17 00:19:35,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:35,879 INFO L225 Difference]: With dead ends: 32 [2024-11-17 00:19:35,879 INFO L226 Difference]: Without dead ends: 32 [2024-11-17 00:19:35,879 INFO L431 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 [2024-11-17 00:19:35,880 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 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 [2024-11-17 00:19:35,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:35,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-17 00:19:35,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-17 00:19:35,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 31 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) [2024-11-17 00:19:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-17 00:19:35,885 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 4 [2024-11-17 00:19:35,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:35,885 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-17 00:19:35,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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) [2024-11-17 00:19:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-17 00:19:35,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-17 00:19:35,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:35,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 00:19:35,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:19:35,886 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-17 00:19:35,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:35,887 INFO L85 PathProgramCache]: Analyzing trace with hash 82034899, now seen corresponding path program 1 times [2024-11-17 00:19:35,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:35,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452747942] [2024-11-17 00:19:35,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:35,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:35,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:35,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452747942] [2024-11-17 00:19:35,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452747942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:35,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:35,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:19:35,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224332186] [2024-11-17 00:19:35,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:35,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:19:35,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:35,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:19:35,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:19:35,904 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-17 00:19:35,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:35,925 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-11-17 00:19:35,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:19:35,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-17 00:19:35,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:35,926 INFO L225 Difference]: With dead ends: 34 [2024-11-17 00:19:35,926 INFO L226 Difference]: Without dead ends: 32 [2024-11-17 00:19:35,926 INFO L431 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 [2024-11-17 00:19:35,927 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:35,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:35,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-17 00:19:35,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-17 00:19:35,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 31 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) [2024-11-17 00:19:35,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-11-17 00:19:35,931 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 5 [2024-11-17 00:19:35,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:35,931 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-17 00:19:35,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2024-11-17 00:19:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-11-17 00:19:35,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:19:35,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:35,932 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:35,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:19:35,933 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-17 00:19:35,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:35,933 INFO L85 PathProgramCache]: Analyzing trace with hash 164530133, now seen corresponding path program 1 times [2024-11-17 00:19:35,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:35,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144433269] [2024-11-17 00:19:35,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:35,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:36,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:36,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144433269] [2024-11-17 00:19:36,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144433269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:36,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:36,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:19:36,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542544153] [2024-11-17 00:19:36,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:36,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:19:36,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:36,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:19:36,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:19:36,013 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:19:36,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:36,045 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-11-17 00:19:36,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:19:36,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-17 00:19:36,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:36,046 INFO L225 Difference]: With dead ends: 34 [2024-11-17 00:19:36,046 INFO L226 Difference]: Without dead ends: 32 [2024-11-17 00:19:36,046 INFO L431 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 [2024-11-17 00:19:36,047 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:36,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-17 00:19:36,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-17 00:19:36,050 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) [2024-11-17 00:19:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-17 00:19:36,051 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 8 [2024-11-17 00:19:36,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:36,051 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-17 00:19:36,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:19:36,052 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-17 00:19:36,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:19:36,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:36,052 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:36,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:19:36,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-17 00:19:36,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:36,054 INFO L85 PathProgramCache]: Analyzing trace with hash -797377868, now seen corresponding path program 1 times [2024-11-17 00:19:36,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:36,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159039774] [2024-11-17 00:19:36,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:36,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:36,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:36,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159039774] [2024-11-17 00:19:36,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159039774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:36,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:36,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:19:36,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242555348] [2024-11-17 00:19:36,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:36,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:19:36,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:36,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:19:36,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:19:36,206 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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) [2024-11-17 00:19:36,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:36,251 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2024-11-17 00:19:36,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:19:36,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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 [2024-11-17 00:19:36,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:36,252 INFO L225 Difference]: With dead ends: 31 [2024-11-17 00:19:36,253 INFO L226 Difference]: Without dead ends: 31 [2024-11-17 00:19:36,253 INFO L431 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 [2024-11-17 00:19:36,255 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:36,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 46 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:36,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-17 00:19:36,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-17 00:19:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.608695652173913) 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) [2024-11-17 00:19:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-17 00:19:36,261 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 10 [2024-11-17 00:19:36,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:36,263 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-17 00:19:36,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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) [2024-11-17 00:19:36,263 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-11-17 00:19:36,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:19:36,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:36,264 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:36,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:19:36,264 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-17 00:19:36,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash -797377867, now seen corresponding path program 1 times [2024-11-17 00:19:36,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:36,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388365386] [2024-11-17 00:19:36,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:36,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:36,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:36,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:36,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388365386] [2024-11-17 00:19:36,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388365386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:36,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:36,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:19:36,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594324011] [2024-11-17 00:19:36,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:36,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:19:36,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:36,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:19:36,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:19:36,422 INFO L87 Difference]: Start difference. First operand 31 states and 37 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) [2024-11-17 00:19:36,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:36,477 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-11-17 00:19:36,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:19:36,478 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 [2024-11-17 00:19:36,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:36,479 INFO L225 Difference]: With dead ends: 40 [2024-11-17 00:19:36,482 INFO L226 Difference]: Without dead ends: 40 [2024-11-17 00:19:36,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:19:36,483 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 9 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:36,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 96 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:36,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-17 00:19:36,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2024-11-17 00:19:36,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.56) 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) [2024-11-17 00:19:36,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-17 00:19:36,495 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 10 [2024-11-17 00:19:36,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:36,496 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-17 00:19:36,496 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) [2024-11-17 00:19:36,496 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-11-17 00:19:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:19:36,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:36,496 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:36,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:19:36,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-17 00:19:36,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:36,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1051089867, now seen corresponding path program 1 times [2024-11-17 00:19:36,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:36,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980996291] [2024-11-17 00:19:36,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:36,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:36,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:36,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980996291] [2024-11-17 00:19:36,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980996291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:36,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:36,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:19:36,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976556720] [2024-11-17 00:19:36,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:36,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:19:36,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:36,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:19:36,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:19:36,677 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:19:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:36,724 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-11-17 00:19:36,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:19:36,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 00:19:36,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:36,725 INFO L225 Difference]: With dead ends: 38 [2024-11-17 00:19:36,725 INFO L226 Difference]: Without dead ends: 38 [2024-11-17 00:19:36,725 INFO L431 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 [2024-11-17 00:19:36,725 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:36,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 67 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:36,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-17 00:19:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2024-11-17 00:19:36,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.48) 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) [2024-11-17 00:19:36,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-17 00:19:36,728 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 11 [2024-11-17 00:19:36,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:36,728 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-17 00:19:36,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:19:36,728 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-11-17 00:19:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:19:36,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:36,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:36,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:19:36,731 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-17 00:19:36,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:36,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1051089868, now seen corresponding path program 1 times [2024-11-17 00:19:36,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:36,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618758652] [2024-11-17 00:19:36,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:36,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:36,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:36,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618758652] [2024-11-17 00:19:36,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618758652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:36,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:36,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:19:36,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089394529] [2024-11-17 00:19:36,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:36,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:19:36,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:36,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:19:36,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:19:36,904 INFO L87 Difference]: Start difference. First operand 31 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) [2024-11-17 00:19:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:36,945 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-17 00:19:36,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:19:36,946 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 [2024-11-17 00:19:36,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:36,947 INFO L225 Difference]: With dead ends: 42 [2024-11-17 00:19:36,947 INFO L226 Difference]: Without dead ends: 42 [2024-11-17 00:19:36,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:19:36,948 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:36,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 107 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:36,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-17 00:19:36,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2024-11-17 00:19:36,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 34 states have internal predecessors, (43), 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) [2024-11-17 00:19:36,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-11-17 00:19:36,951 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 11 [2024-11-17 00:19:36,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:36,951 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-11-17 00:19:36,951 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) [2024-11-17 00:19:36,951 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-11-17 00:19:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:19:36,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:36,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:36,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:19:36,951 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-17 00:19:36,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:36,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1775458060, now seen corresponding path program 1 times [2024-11-17 00:19:36,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:36,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411586599] [2024-11-17 00:19:36,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:36,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:36,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:36,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:36,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411586599] [2024-11-17 00:19:36,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411586599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:36,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:36,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:19:36,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82181186] [2024-11-17 00:19:36,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:36,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:19:36,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:36,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:19:36,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:19:36,995 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 4 states, 3 states have (on average 4.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) [2024-11-17 00:19:37,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:37,021 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-11-17 00:19:37,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:19:37,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.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 [2024-11-17 00:19:37,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:37,021 INFO L225 Difference]: With dead ends: 34 [2024-11-17 00:19:37,021 INFO L226 Difference]: Without dead ends: 34 [2024-11-17 00:19:37,021 INFO L431 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 [2024-11-17 00:19:37,022 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:37,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 46 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:37,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-17 00:19:37,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-17 00:19:37,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4482758620689655) 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) [2024-11-17 00:19:37,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-17 00:19:37,024 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 12 [2024-11-17 00:19:37,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:37,024 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-17 00:19:37,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.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) [2024-11-17 00:19:37,024 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-11-17 00:19:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-17 00:19:37,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:37,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:37,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:19:37,028 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-17 00:19:37,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:37,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1775458059, now seen corresponding path program 1 times [2024-11-17 00:19:37,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:37,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756370493] [2024-11-17 00:19:37,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:37,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:37,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:37,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756370493] [2024-11-17 00:19:37,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756370493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:37,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:37,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:19:37,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129354887] [2024-11-17 00:19:37,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:37,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:19:37,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:37,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:19:37,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:19:37,121 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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) [2024-11-17 00:19:37,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:37,147 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-17 00:19:37,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:19:37,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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 [2024-11-17 00:19:37,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:37,147 INFO L225 Difference]: With dead ends: 43 [2024-11-17 00:19:37,148 INFO L226 Difference]: Without dead ends: 43 [2024-11-17 00:19:37,148 INFO L431 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 [2024-11-17 00:19:37,148 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 19 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:37,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 110 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:37,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-17 00:19:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2024-11-17 00:19:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 39 states have internal predecessors, (48), 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) [2024-11-17 00:19:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-11-17 00:19:37,151 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 12 [2024-11-17 00:19:37,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:37,151 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-17 00:19:37,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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) [2024-11-17 00:19:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-11-17 00:19:37,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:19:37,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:37,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:37,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:19:37,155 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-17 00:19:37,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:37,155 INFO L85 PathProgramCache]: Analyzing trace with hash 795347194, now seen corresponding path program 1 times [2024-11-17 00:19:37,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:37,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221631837] [2024-11-17 00:19:37,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:37,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:37,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:37,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:37,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221631837] [2024-11-17 00:19:37,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221631837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:37,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:37,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:19:37,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523895193] [2024-11-17 00:19:37,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:37,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:19:37,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:37,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:19:37,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:19:37,295 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:19:37,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:37,329 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2024-11-17 00:19:37,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:19:37,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-17 00:19:37,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:37,330 INFO L225 Difference]: With dead ends: 44 [2024-11-17 00:19:37,330 INFO L226 Difference]: Without dead ends: 44 [2024-11-17 00:19:37,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:19:37,331 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:37,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:37,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-17 00:19:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2024-11-17 00:19:37,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 41 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) [2024-11-17 00:19:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2024-11-17 00:19:37,333 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 13 [2024-11-17 00:19:37,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:37,336 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-17 00:19:37,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:19:37,336 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2024-11-17 00:19:37,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:19:37,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:37,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:37,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:19:37,337 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-17 00:19:37,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:37,337 INFO L85 PathProgramCache]: Analyzing trace with hash 795933052, now seen corresponding path program 1 times [2024-11-17 00:19:37,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:37,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73848984] [2024-11-17 00:19:37,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:37,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:37,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:37,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73848984] [2024-11-17 00:19:37,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73848984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:37,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:37,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:19:37,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588321757] [2024-11-17 00:19:37,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:37,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:19:37,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:37,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:19:37,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:19:37,478 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:19:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:37,505 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-11-17 00:19:37,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:19:37,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-17 00:19:37,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:37,506 INFO L225 Difference]: With dead ends: 41 [2024-11-17 00:19:37,506 INFO L226 Difference]: Without dead ends: 36 [2024-11-17 00:19:37,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:19:37,507 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 20 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 89 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 [2024-11-17 00:19:37,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 89 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:37,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-17 00:19:37,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-17 00:19:37,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.25) 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) [2024-11-17 00:19:37,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-11-17 00:19:37,509 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 13 [2024-11-17 00:19:37,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:37,509 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-17 00:19:37,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:19:37,509 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-11-17 00:19:37,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:19:37,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:37,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:37,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:19:37,514 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-17 00:19:37,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:37,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1993635420, now seen corresponding path program 1 times [2024-11-17 00:19:37,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:37,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922000558] [2024-11-17 00:19:37,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:37,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:37,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:37,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922000558] [2024-11-17 00:19:37,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922000558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:19:37,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:19:37,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:19:37,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732422277] [2024-11-17 00:19:37,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:19:37,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:19:37,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:37,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:19:37,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:19:37,597 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) [2024-11-17 00:19:37,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:37,611 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-11-17 00:19:37,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:19:37,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 [2024-11-17 00:19:37,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:37,612 INFO L225 Difference]: With dead ends: 38 [2024-11-17 00:19:37,614 INFO L226 Difference]: Without dead ends: 37 [2024-11-17 00:19:37,614 INFO L431 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 [2024-11-17 00:19:37,615 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:37,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 62 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:19:37,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-17 00:19:37,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2024-11-17 00:19:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 32 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) [2024-11-17 00:19:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-17 00:19:37,619 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 15 [2024-11-17 00:19:37,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:37,619 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-17 00:19:37,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) [2024-11-17 00:19:37,619 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-17 00:19:37,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:19:37,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:37,619 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:37,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:19:37,619 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-17 00:19:37,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:37,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1993572443, now seen corresponding path program 1 times [2024-11-17 00:19:37,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:37,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445798100] [2024-11-17 00:19:37,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:37,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:38,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:19:38,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445798100] [2024-11-17 00:19:38,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445798100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:19:38,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50226092] [2024-11-17 00:19:38,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:38,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:19:38,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:19:38,044 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) [2024-11-17 00:19:38,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 00:19:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:19:38,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-17 00:19:38,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:19:38,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-17 00:19:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:38,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:19:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:19:38,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50226092] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:19:38,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:19:38,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 22 [2024-11-17 00:19:38,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749695054] [2024-11-17 00:19:38,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:19:38,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-17 00:19:38,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:19:38,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-17 00:19:38,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2024-11-17 00:19:38,633 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 states have internal predecessors, (36), 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) [2024-11-17 00:19:38,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:19:38,939 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2024-11-17 00:19:38,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 00:19:38,939 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 states have internal predecessors, (36), 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 [2024-11-17 00:19:38,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:19:38,940 INFO L225 Difference]: With dead ends: 51 [2024-11-17 00:19:38,940 INFO L226 Difference]: Without dead ends: 51 [2024-11-17 00:19:38,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2024-11-17 00:19:38,941 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 29 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:19:38,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 111 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:19:38,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-17 00:19:38,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2024-11-17 00:19:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 39 states have internal predecessors, (47), 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) [2024-11-17 00:19:38,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2024-11-17 00:19:38,943 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 15 [2024-11-17 00:19:38,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:19:38,943 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-11-17 00:19:38,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 23 states have internal predecessors, (36), 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) [2024-11-17 00:19:38,944 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2024-11-17 00:19:38,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:19:38,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:19:38,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:38,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 00:19:39,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-17 00:19:39,149 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-17 00:19:39,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:19:39,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1671247281, now seen corresponding path program 1 times [2024-11-17 00:19:39,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:19:39,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072980749] [2024-11-17 00:19:39,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:19:39,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:19:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 00:19:39,173 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 00:19:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 00:19:39,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 00:19:39,201 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 00:19:39,202 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 11 remaining) [2024-11-17 00:19:39,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 11 remaining) [2024-11-17 00:19:39,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2024-11-17 00:19:39,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 11 remaining) [2024-11-17 00:19:39,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 11 remaining) [2024-11-17 00:19:39,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2024-11-17 00:19:39,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2024-11-17 00:19:39,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 11 remaining) [2024-11-17 00:19:39,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2024-11-17 00:19:39,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 11 remaining) [2024-11-17 00:19:39,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 11 remaining) [2024-11-17 00:19:39,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 00:19:39,207 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:19:39,227 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 00:19:39,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:19:39 BoogieIcfgContainer [2024-11-17 00:19:39,230 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 00:19:39,230 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 00:19:39,231 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 00:19:39,231 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 00:19:39,231 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:19:35" (3/4) ... [2024-11-17 00:19:39,232 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-17 00:19:39,263 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 00:19:39,263 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 00:19:39,263 INFO L158 Benchmark]: Toolchain (without parser) took 4971.71ms. Allocated memory was 155.2MB in the beginning and 268.4MB in the end (delta: 113.2MB). Free memory was 80.4MB in the beginning and 195.1MB in the end (delta: -114.7MB). Peak memory consumption was 713.7kB. Max. memory is 16.1GB. [2024-11-17 00:19:39,265 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:19:39,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.48ms. Allocated memory is still 155.2MB. Free memory was 80.2MB in the beginning and 61.5MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-17 00:19:39,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.33ms. Allocated memory is still 155.2MB. Free memory was 61.5MB in the beginning and 59.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:19:39,266 INFO L158 Benchmark]: Boogie Preprocessor took 45.15ms. Allocated memory is still 155.2MB. Free memory was 59.4MB in the beginning and 57.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:19:39,266 INFO L158 Benchmark]: IcfgBuilder took 413.19ms. Allocated memory was 155.2MB in the beginning and 222.3MB in the end (delta: 67.1MB). Free memory was 57.3MB in the beginning and 180.2MB in the end (delta: -122.9MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-11-17 00:19:39,266 INFO L158 Benchmark]: TraceAbstraction took 4026.83ms. Allocated memory was 222.3MB in the beginning and 268.4MB in the end (delta: 46.1MB). Free memory was 180.2MB in the beginning and 197.2MB in the end (delta: -17.0MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2024-11-17 00:19:39,266 INFO L158 Benchmark]: Witness Printer took 32.44ms. Allocated memory is still 268.4MB. Free memory was 197.2MB in the beginning and 195.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:19:39,267 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.48ms. Allocated memory is still 155.2MB. Free memory was 80.2MB in the beginning and 61.5MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.33ms. Allocated memory is still 155.2MB. Free memory was 61.5MB in the beginning and 59.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.15ms. Allocated memory is still 155.2MB. Free memory was 59.4MB in the beginning and 57.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 413.19ms. Allocated memory was 155.2MB in the beginning and 222.3MB in the end (delta: 67.1MB). Free memory was 57.3MB in the beginning and 180.2MB in the end (delta: -122.9MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4026.83ms. Allocated memory was 222.3MB in the beginning and 268.4MB in the end (delta: 46.1MB). Free memory was 180.2MB in the beginning and 197.2MB in the end (delta: -17.0MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * Witness Printer took 32.44ms. Allocated memory is still 268.4MB. Free memory was 197.2MB in the beginning and 195.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L529] int in_len = __VERIFIER_nondet_int(); [L530] COND FALSE !(in_len < 1) [L531] char* in = __builtin_alloca (in_len); VAL [in={4:0}, in_len=1] [L532] in[in_len-1]=0 [L533] int out_len = __VERIFIER_nondet_int(); [L534] COND FALSE !(out_len < 1) [L535] char* out = __builtin_alloca (out_len); [L536] CALL strlcpy(in, out, out_len) [L511] register char *d = dst; [L512] register const char *s = src; [L513] register size_t n = siz; [L514] n != 0 && --n != 0 [L514] EXPR --n [L514] n != 0 && --n != 0 VAL [d={4:0}, n=1, s={3:0}, siz=2] [L514] COND TRUE n != 0 && --n != 0 [L516] EXPR d++ [L516] EXPR s++ VAL [d={4:1}, n=1, s={3:1}, siz=2] [L516] EXPR s++ [L516] EXPR *d++ = *s++ [L516] COND FALSE !((*d++ = *s++) == 0) [L518] EXPR --n VAL [d={4:1}, n=0, s={3:1}, siz=2] [L518] COND FALSE !(--n != 0) [L520] COND TRUE n == 0 [L521] COND TRUE siz != 0 [L522] *d = '\0' - UnprovableResult [Line: 528]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 161 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 1122 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 715 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 692 IncrementalHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 407 mSDtfsCounter, 692 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=11, InterpolantAutomatonStates: 72, 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, 14 MinimizatonAttempts, 41 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 1098 SizeOfPredicates, 4 NumberOfNonLiveVariables, 143 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 0/6 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-17 00:19:39,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)