./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 023d838f 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/forester-heap/dll-01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:47:59,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:47:59,691 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-10 14:47:59,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:47:59,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:47:59,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:47:59,713 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:47:59,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:47:59,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 14:47:59,714 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 14:47:59,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:47:59,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:47:59,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:47:59,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:47:59,715 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:47:59,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:47:59,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:47:59,716 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:47:59,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:47:59,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:47:59,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:47:59,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:47:59,717 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 14:47:59,717 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 14:47:59,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:47:59,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:47:59,718 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 14:47:59,718 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:47:59,718 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:47:59,719 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:47:59,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:47:59,719 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:47:59,719 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:47:59,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:47:59,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 14:47:59,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:47:59,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:47:59,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:47:59,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:47:59,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:47:59,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:47:59,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:47:59,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:47:59,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:47:59,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:47:59,724 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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee [2024-11-10 14:47:59,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:47:59,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:47:59,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:47:59,939 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:47:59,939 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:47:59,940 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-01-1.i [2024-11-10 14:48:01,122 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:48:01,326 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:48:01,328 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i [2024-11-10 14:48:01,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bb70cc14/ca22476e2a4a4d0190408c8254e16438/FLAGb75bf4761 [2024-11-10 14:48:01,357 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bb70cc14/ca22476e2a4a4d0190408c8254e16438 [2024-11-10 14:48:01,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:48:01,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:48:01,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:48:01,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:48:01,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:48:01,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:48:01" (1/1) ... [2024-11-10 14:48:01,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40983d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:01, skipping insertion in model container [2024-11-10 14:48:01,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:48:01" (1/1) ... [2024-11-10 14:48:01,400 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:48:01,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:48:01,710 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:48:01,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:48:01,805 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:48:01,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:01 WrapperNode [2024-11-10 14:48:01,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:48:01,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:48:01,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:48:01,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:48:01,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:01" (1/1) ... [2024-11-10 14:48:01,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:01" (1/1) ... [2024-11-10 14:48:01,840 INFO L138 Inliner]: procedures = 119, calls = 57, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 211 [2024-11-10 14:48:01,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:48:01,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:48:01,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:48:01,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:48:01,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:01" (1/1) ... [2024-11-10 14:48:01,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:01" (1/1) ... [2024-11-10 14:48:01,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:01" (1/1) ... [2024-11-10 14:48:01,872 INFO L175 MemorySlicer]: Split 34 memory accesses to 2 slices as follows [2, 32]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 13 writes are split as follows [0, 13]. [2024-11-10 14:48:01,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:01" (1/1) ... [2024-11-10 14:48:01,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:01" (1/1) ... [2024-11-10 14:48:01,882 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:01" (1/1) ... [2024-11-10 14:48:01,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:01" (1/1) ... [2024-11-10 14:48:01,888 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:01" (1/1) ... [2024-11-10 14:48:01,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:01" (1/1) ... [2024-11-10 14:48:01,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:48:01,895 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:48:01,895 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:48:01,895 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:48:01,896 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:01" (1/1) ... [2024-11-10 14:48:01,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:48:01,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:48:01,927 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-10 14:48:01,933 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-10 14:48:01,969 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-10 14:48:01,969 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-10 14:48:01,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:48:01,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:48:01,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 14:48:01,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 14:48:01,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 14:48:01,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 14:48:01,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:48:01,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 14:48:01,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 14:48:01,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:48:01,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:48:02,067 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:48:02,069 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:48:02,299 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-10 14:48:02,299 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:48:02,311 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:48:02,311 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:48:02,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:48:02 BoogieIcfgContainer [2024-11-10 14:48:02,311 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:48:02,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:48:02,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:48:02,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:48:02,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:48:01" (1/3) ... [2024-11-10 14:48:02,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46001e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:48:02, skipping insertion in model container [2024-11-10 14:48:02,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:48:01" (2/3) ... [2024-11-10 14:48:02,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46001e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:48:02, skipping insertion in model container [2024-11-10 14:48:02,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:48:02" (3/3) ... [2024-11-10 14:48:02,317 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2024-11-10 14:48:02,328 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:48:02,328 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 14:48:02,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:48:02,373 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;@6c2d1ce8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:48:02,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 14:48:02,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 84 states have (on average 1.6666666666666667) internal successors, (140), 86 states have internal predecessors, (140), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 14:48:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 14:48:02,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:02,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:02,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:02,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:02,391 INFO L85 PathProgramCache]: Analyzing trace with hash 582161272, now seen corresponding path program 1 times [2024-11-10 14:48:02,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:02,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030118183] [2024-11-10 14:48:02,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:02,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:02,573 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-10 14:48:02,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:02,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030118183] [2024-11-10 14:48:02,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030118183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:48:02,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:48:02,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:48:02,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574933367] [2024-11-10 14:48:02,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:48:02,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:48:02,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:48:02,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:48:02,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:48:02,597 INFO L87 Difference]: Start difference. First operand has 101 states, 84 states have (on average 1.6666666666666667) internal successors, (140), 86 states have internal predecessors, (140), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:02,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:02,638 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2024-11-10 14:48:02,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:48:02,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-10 14:48:02,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:02,645 INFO L225 Difference]: With dead ends: 102 [2024-11-10 14:48:02,645 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 14:48:02,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 14:48:02,649 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 80 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:02,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 132 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:48:02,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 14:48:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2024-11-10 14:48:02,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 82 states have internal predecessors, (92), 12 states have call successors, (12), 1 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:02,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2024-11-10 14:48:02,673 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 7 [2024-11-10 14:48:02,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:02,673 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2024-11-10 14:48:02,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:02,674 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2024-11-10 14:48:02,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 14:48:02,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:02,674 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:02,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:48:02,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:02,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:02,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1819413018, now seen corresponding path program 1 times [2024-11-10 14:48:02,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:02,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098938566] [2024-11-10 14:48:02,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:02,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:02,877 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-10 14:48:02,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:02,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098938566] [2024-11-10 14:48:02,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098938566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:48:02,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:48:02,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:48:02,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514686006] [2024-11-10 14:48:02,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:48:02,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:48:02,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:48:02,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:48:02,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:48:02,883 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:02,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:02,975 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2024-11-10 14:48:02,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:48:02,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-10 14:48:02,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:02,978 INFO L225 Difference]: With dead ends: 84 [2024-11-10 14:48:02,978 INFO L226 Difference]: Without dead ends: 84 [2024-11-10 14:48:02,978 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-10 14:48:02,979 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:02,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:48:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-10 14:48:02,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-11-10 14:48:02,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.3) internal successors, (91), 81 states have internal predecessors, (91), 11 states have call successors, (11), 1 states have call predecessors, (11), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2024-11-10 14:48:02,985 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 13 [2024-11-10 14:48:02,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:02,985 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2024-11-10 14:48:02,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2024-11-10 14:48:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 14:48:02,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:02,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:02,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:48:02,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:02,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:02,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1005358971, now seen corresponding path program 1 times [2024-11-10 14:48:02,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:02,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763940297] [2024-11-10 14:48:02,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:02,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:03,219 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-10 14:48:03,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:03,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763940297] [2024-11-10 14:48:03,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763940297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:48:03,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:48:03,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:48:03,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516747140] [2024-11-10 14:48:03,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:48:03,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:48:03,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:48:03,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:48:03,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:48:03,221 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:03,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:03,335 INFO L93 Difference]: Finished difference Result 122 states and 151 transitions. [2024-11-10 14:48:03,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:48:03,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-10 14:48:03,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:03,336 INFO L225 Difference]: With dead ends: 122 [2024-11-10 14:48:03,336 INFO L226 Difference]: Without dead ends: 122 [2024-11-10 14:48:03,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:48:03,337 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 150 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:03,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 196 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:48:03,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-10 14:48:03,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 81. [2024-11-10 14:48:03,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 79 states have internal predecessors, (89), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:03,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2024-11-10 14:48:03,349 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 19 [2024-11-10 14:48:03,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:03,349 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2024-11-10 14:48:03,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:03,350 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2024-11-10 14:48:03,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 14:48:03,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:03,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:03,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:48:03,350 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:03,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:03,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1503492990, now seen corresponding path program 1 times [2024-11-10 14:48:03,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:03,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307523481] [2024-11-10 14:48:03,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:03,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:03,403 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-10 14:48:03,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:03,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307523481] [2024-11-10 14:48:03,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307523481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:48:03,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:48:03,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:48:03,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689100487] [2024-11-10 14:48:03,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:48:03,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:48:03,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:48:03,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:48:03,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:48:03,408 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:03,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:03,465 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2024-11-10 14:48:03,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:48:03,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-10 14:48:03,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:03,467 INFO L225 Difference]: With dead ends: 118 [2024-11-10 14:48:03,467 INFO L226 Difference]: Without dead ends: 118 [2024-11-10 14:48:03,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:48:03,468 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 133 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:03,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 158 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:48:03,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-10 14:48:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 82. [2024-11-10 14:48:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.25) internal successors, (90), 80 states have internal predecessors, (90), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:03,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2024-11-10 14:48:03,476 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 20 [2024-11-10 14:48:03,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:03,477 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2024-11-10 14:48:03,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:03,477 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2024-11-10 14:48:03,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 14:48:03,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:03,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:03,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:48:03,478 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:03,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:03,478 INFO L85 PathProgramCache]: Analyzing trace with hash -733608519, now seen corresponding path program 1 times [2024-11-10 14:48:03,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:03,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400943407] [2024-11-10 14:48:03,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:03,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:03,537 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-10 14:48:03,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:03,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400943407] [2024-11-10 14:48:03,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400943407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:48:03,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:48:03,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:48:03,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114641494] [2024-11-10 14:48:03,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:48:03,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:48:03,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:48:03,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:48:03,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:48:03,540 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:03,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:03,556 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2024-11-10 14:48:03,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:48:03,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-10 14:48:03,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:03,558 INFO L225 Difference]: With dead ends: 89 [2024-11-10 14:48:03,558 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 14:48:03,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 14:48:03,559 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:03,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 179 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:48:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 14:48:03,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-11-10 14:48:03,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 85 states have internal predecessors, (96), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:03,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2024-11-10 14:48:03,563 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 27 [2024-11-10 14:48:03,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:03,563 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2024-11-10 14:48:03,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:03,563 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2024-11-10 14:48:03,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 14:48:03,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:03,564 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:03,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:48:03,564 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:03,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:03,565 INFO L85 PathProgramCache]: Analyzing trace with hash 415849707, now seen corresponding path program 1 times [2024-11-10 14:48:03,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:03,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296493567] [2024-11-10 14:48:03,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:03,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:03,606 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-10 14:48:03,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:03,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296493567] [2024-11-10 14:48:03,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296493567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:48:03,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:48:03,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:48:03,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891595367] [2024-11-10 14:48:03,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:48:03,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:48:03,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:48:03,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:48:03,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:48:03,611 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:03,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:03,622 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2024-11-10 14:48:03,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:48:03,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-10 14:48:03,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:03,625 INFO L225 Difference]: With dead ends: 86 [2024-11-10 14:48:03,626 INFO L226 Difference]: Without dead ends: 86 [2024-11-10 14:48:03,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 14:48:03,627 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 11 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:03,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 161 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:48:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-10 14:48:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-10 14:48:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 84 states have internal predecessors, (95), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2024-11-10 14:48:03,630 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 28 [2024-11-10 14:48:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:03,630 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2024-11-10 14:48:03,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:03,630 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2024-11-10 14:48:03,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 14:48:03,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:03,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:03,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:48:03,635 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:03,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:03,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1992972339, now seen corresponding path program 1 times [2024-11-10 14:48:03,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:03,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16292927] [2024-11-10 14:48:03,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:03,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:03,741 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-10 14:48:03,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:03,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16292927] [2024-11-10 14:48:03,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16292927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:48:03,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:48:03,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:48:03,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680358431] [2024-11-10 14:48:03,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:48:03,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:48:03,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:48:03,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:48:03,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:48:03,743 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:03,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:03,790 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2024-11-10 14:48:03,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:48:03,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-10 14:48:03,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:03,791 INFO L225 Difference]: With dead ends: 86 [2024-11-10 14:48:03,791 INFO L226 Difference]: Without dead ends: 86 [2024-11-10 14:48:03,791 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-10 14:48:03,792 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 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-10 14:48:03,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:48:03,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-10 14:48:03,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-11-10 14:48:03,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 83 states have internal predecessors, (94), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:03,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2024-11-10 14:48:03,799 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 28 [2024-11-10 14:48:03,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:03,799 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2024-11-10 14:48:03,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:03,799 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2024-11-10 14:48:03,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 14:48:03,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:03,800 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:03,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:48:03,800 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:03,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:03,801 INFO L85 PathProgramCache]: Analyzing trace with hash -48018941, now seen corresponding path program 1 times [2024-11-10 14:48:03,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:03,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643155814] [2024-11-10 14:48:03,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:03,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:03,973 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-10 14:48:03,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:03,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643155814] [2024-11-10 14:48:03,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643155814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:48:03,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:48:03,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 14:48:03,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61236317] [2024-11-10 14:48:03,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:48:03,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:48:03,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:48:03,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:48:03,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:48:03,976 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:04,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:04,138 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2024-11-10 14:48:04,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 14:48:04,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-10 14:48:04,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:04,140 INFO L225 Difference]: With dead ends: 155 [2024-11-10 14:48:04,140 INFO L226 Difference]: Without dead ends: 155 [2024-11-10 14:48:04,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:48:04,142 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 72 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:04,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 379 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:48:04,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-10 14:48:04,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 100. [2024-11-10 14:48:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 92 states have (on average 1.2065217391304348) internal successors, (111), 98 states have internal predecessors, (111), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2024-11-10 14:48:04,151 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 31 [2024-11-10 14:48:04,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:04,151 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2024-11-10 14:48:04,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2024-11-10 14:48:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 14:48:04,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:04,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:04,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:48:04,153 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:04,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:04,153 INFO L85 PathProgramCache]: Analyzing trace with hash -880463803, now seen corresponding path program 1 times [2024-11-10 14:48:04,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:04,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921170887] [2024-11-10 14:48:04,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:04,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:48:04,650 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-10 14:48:04,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:48:04,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921170887] [2024-11-10 14:48:04,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921170887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:48:04,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:48:04,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 14:48:04,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571930188] [2024-11-10 14:48:04,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:48:04,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 14:48:04,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:48:04,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 14:48:04,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:48:04,652 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:04,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:48:04,932 INFO L93 Difference]: Finished difference Result 217 states and 258 transitions. [2024-11-10 14:48:04,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 14:48:04,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-10 14:48:04,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:48:04,934 INFO L225 Difference]: With dead ends: 217 [2024-11-10 14:48:04,934 INFO L226 Difference]: Without dead ends: 217 [2024-11-10 14:48:04,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-10 14:48:04,935 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 198 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 14:48:04,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 484 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 14:48:04,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-10 14:48:04,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 116. [2024-11-10 14:48:04,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 114 states have internal predecessors, (129), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:04,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2024-11-10 14:48:04,940 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 31 [2024-11-10 14:48:04,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:48:04,940 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2024-11-10 14:48:04,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:48:04,941 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2024-11-10 14:48:04,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-10 14:48:04,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:48:04,942 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:04,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:48:04,942 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:48:04,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:48:04,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1642726957, now seen corresponding path program 1 times [2024-11-10 14:48:04,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:48:04,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178066870] [2024-11-10 14:48:04,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:48:04,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:48:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:48:04,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:48:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:48:04,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:48:04,994 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:48:04,995 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-10 14:48:04,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-10 14:48:04,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:48:04,998 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:48:05,026 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:48:05,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:48:05 BoogieIcfgContainer [2024-11-10 14:48:05,028 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:48:05,028 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:48:05,028 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:48:05,029 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:48:05,029 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:48:02" (3/4) ... [2024-11-10 14:48:05,029 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 14:48:05,062 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:48:05,062 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:48:05,063 INFO L158 Benchmark]: Toolchain (without parser) took 3702.66ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 84.8MB in the beginning and 116.2MB in the end (delta: -31.3MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2024-11-10 14:48:05,063 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 113.2MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:48:05,063 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.45ms. Allocated memory is still 155.2MB. Free memory was 84.7MB in the beginning and 121.6MB in the end (delta: -36.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 14:48:05,063 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.11ms. Allocated memory is still 155.2MB. Free memory was 121.6MB in the beginning and 118.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:48:05,063 INFO L158 Benchmark]: Boogie Preprocessor took 53.54ms. Allocated memory is still 155.2MB. Free memory was 118.9MB in the beginning and 116.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:48:05,064 INFO L158 Benchmark]: IcfgBuilder took 416.52ms. Allocated memory is still 155.2MB. Free memory was 116.3MB in the beginning and 92.2MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 14:48:05,064 INFO L158 Benchmark]: TraceAbstraction took 2715.45ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 91.7MB in the beginning and 119.3MB in the end (delta: -27.7MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2024-11-10 14:48:05,064 INFO L158 Benchmark]: Witness Printer took 34.11ms. Allocated memory is still 216.0MB. Free memory was 119.3MB in the beginning and 116.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:48:05,067 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.68ms. Allocated memory is still 113.2MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.45ms. Allocated memory is still 155.2MB. Free memory was 84.7MB in the beginning and 121.6MB in the end (delta: -36.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.11ms. Allocated memory is still 155.2MB. Free memory was 121.6MB in the beginning and 118.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.54ms. Allocated memory is still 155.2MB. Free memory was 118.9MB in the beginning and 116.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 416.52ms. Allocated memory is still 155.2MB. Free memory was 116.3MB in the beginning and 92.2MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2715.45ms. Allocated memory was 155.2MB in the beginning and 216.0MB in the end (delta: 60.8MB). Free memory was 91.7MB in the beginning and 119.3MB in the end (delta: -27.7MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. * Witness Printer took 34.11ms. Allocated memory is still 216.0MB. Free memory was 119.3MB in the beginning and 116.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. 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: 992]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1003] SLL* list = malloc(sizeof(SLL)); [L1004] list->next = ((void*)0) [L1005] list->prev = ((void*)0) [L1006] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1006] COND FALSE !(0) VAL [list={-1:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1006] list->inner = malloc(sizeof(SLL)) [L1006] EXPR list->inner [L1006] list->inner->next = ((void*)0) [L1006] EXPR list->inner [L1006] list->inner->inner = ((void*)0) [L1006] EXPR list->inner [L1006] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}] [L1006] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L1006] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] COND FALSE !(0) VAL [list={-1:0}] [L1008] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1022] end = ((void*)0) [L1023] end = list VAL [end={-1:0}, list={-1:0}] [L1026] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1026] COND FALSE !(0) VAL [end={-1:0}, list={-1:0}] [L1028] COND TRUE ((void*)0) != end [L1030] int len = 0; [L1031] EXPR end->inner [L1031] SLL* inner = end->inner; [L1032] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1034] COND TRUE len == 0 [L1035] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1038] COND FALSE !(0) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1039] EXPR inner->inner [L1039] COND FALSE !(!(((void*)0) == inner->inner)) [L1039] COND FALSE !(0) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1040] EXPR inner->next [L1040] COND TRUE !(((void*)0) != inner->next) [L1040] CALL reach_error() [L992] COND FALSE !(0) [L992] __assert_fail ("0", "dll-01-1.c", 12, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: 1000]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 647 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 647 mSDsluCounter, 2184 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1379 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 599 IncrementalHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 805 mSDtfsCounter, 599 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=9, InterpolantAutomatonStates: 41, 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, 9 MinimizatonAttempts, 252 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 1198 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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-10 14:48:05,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)