./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/termination-recursive-malloc/rec_malloc_ex3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 33d006375056e7e3c58d58b776bed0fedce081ec4ff9e691f038a741177fe7dd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:06:10,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:06:10,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-10 15:06:10,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:06:10,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:06:10,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:06:10,445 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:06:10,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:06:10,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:06:10,447 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:06:10,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:06:10,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:06:10,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:06:10,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:06:10,449 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:06:10,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:06:10,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:06:10,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:06:10,452 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:06:10,453 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:06:10,453 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:06:10,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:06:10,458 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:06:10,458 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:06:10,458 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:06:10,458 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:06:10,459 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:06:10,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:06:10,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:06:10,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:06:10,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:06:10,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:06:10,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:06:10,460 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:06:10,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:06:10,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:06:10,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:06:10,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:06:10,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:06:10,463 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 33d006375056e7e3c58d58b776bed0fedce081ec4ff9e691f038a741177fe7dd [2024-11-10 15:06:10,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:06:10,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:06:10,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:06:10,732 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:06:10,733 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:06:10,734 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i [2024-11-10 15:06:12,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:06:12,363 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:06:12,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i [2024-11-10 15:06:12,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f560bf500/74e7048ff3d74d95a846aaa6701206c5/FLAGcea24a253 [2024-11-10 15:06:12,764 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f560bf500/74e7048ff3d74d95a846aaa6701206c5 [2024-11-10 15:06:12,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:06:12,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:06:12,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:06:12,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:06:12,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:06:12,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:06:12" (1/1) ... [2024-11-10 15:06:12,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b4d979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:12, skipping insertion in model container [2024-11-10 15:06:12,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:06:12" (1/1) ... [2024-11-10 15:06:12,790 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:06:12,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:06:12,969 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:06:12,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:06:12,995 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:06:12,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:12 WrapperNode [2024-11-10 15:06:12,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:06:12,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:06:12,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:06:12,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:06:13,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:12" (1/1) ... [2024-11-10 15:06:13,008 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:12" (1/1) ... [2024-11-10 15:06:13,024 INFO L138 Inliner]: procedures = 11, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2024-11-10 15:06:13,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:06:13,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:06:13,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:06:13,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:06:13,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:12" (1/1) ... [2024-11-10 15:06:13,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:12" (1/1) ... [2024-11-10 15:06:13,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:12" (1/1) ... [2024-11-10 15:06:13,069 INFO L175 MemorySlicer]: Split 5 memory accesses to 1 slices as follows [5]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-11-10 15:06:13,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:12" (1/1) ... [2024-11-10 15:06:13,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:12" (1/1) ... [2024-11-10 15:06:13,074 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:12" (1/1) ... [2024-11-10 15:06:13,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:12" (1/1) ... [2024-11-10 15:06:13,076 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:12" (1/1) ... [2024-11-10 15:06:13,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:12" (1/1) ... [2024-11-10 15:06:13,078 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:06:13,079 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:06:13,079 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:06:13,079 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:06:13,080 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:12" (1/1) ... [2024-11-10 15:06:13,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:06:13,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:06:13,112 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 15:06:13,115 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 15:06:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 15:06:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2024-11-10 15:06:13,165 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2024-11-10 15:06:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:06:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:06:13,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:06:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 15:06:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:06:13,224 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:06:13,226 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:06:13,345 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: havoc #t~ret5; [2024-11-10 15:06:13,345 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L9: havoc ~pv~0; [2024-11-10 15:06:13,396 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-10 15:06:13,397 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:06:13,408 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:06:13,409 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:06:13,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:06:13 BoogieIcfgContainer [2024-11-10 15:06:13,409 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:06:13,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:06:13,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:06:13,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:06:13,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:06:12" (1/3) ... [2024-11-10 15:06:13,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f2f90d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:06:13, skipping insertion in model container [2024-11-10 15:06:13,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:06:12" (2/3) ... [2024-11-10 15:06:13,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f2f90d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:06:13, skipping insertion in model container [2024-11-10 15:06:13,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:06:13" (3/3) ... [2024-11-10 15:06:13,422 INFO L112 eAbstractionObserver]: Analyzing ICFG rec_malloc_ex3.i [2024-11-10 15:06:13,439 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:06:13,440 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-10 15:06:13,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:06:13,492 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;@645f78fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:06:13,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-10 15:06:13,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 40 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:06:13,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:06:13,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:13,504 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:06:13,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-10 15:06:13,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:13,511 INFO L85 PathProgramCache]: Analyzing trace with hash 73448679, now seen corresponding path program 1 times [2024-11-10 15:06:13,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:13,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050827635] [2024-11-10 15:06:13,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:13,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:13,774 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 15:06:13,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:13,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050827635] [2024-11-10 15:06:13,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050827635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:06:13,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:06:13,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:06:13,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190933986] [2024-11-10 15:06:13,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:06:13,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:06:13,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:13,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:06:13,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:06:13,827 INFO L87 Difference]: Start difference. First operand has 44 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 40 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:06:13,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:13,904 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2024-11-10 15:06:13,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:06:13,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:06:13,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:13,914 INFO L225 Difference]: With dead ends: 43 [2024-11-10 15:06:13,914 INFO L226 Difference]: Without dead ends: 40 [2024-11-10 15:06:13,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:06:13,920 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:13,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 65 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:06:13,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-10 15:06:13,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-10 15:06:13,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 36 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:06:13,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2024-11-10 15:06:13,960 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 5 [2024-11-10 15:06:13,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:13,960 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2024-11-10 15:06:13,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:06:13,961 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2024-11-10 15:06:13,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 15:06:13,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:13,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 15:06:13,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:06:13,962 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-10 15:06:13,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:13,963 INFO L85 PathProgramCache]: Analyzing trace with hash 73448680, now seen corresponding path program 1 times [2024-11-10 15:06:13,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:13,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014416901] [2024-11-10 15:06:13,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:13,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:13,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:14,073 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 15:06:14,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014416901] [2024-11-10 15:06:14,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014416901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:06:14,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:06:14,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:06:14,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129124721] [2024-11-10 15:06:14,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:06:14,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:06:14,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:14,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:06:14,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:06:14,077 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:06:14,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:14,109 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2024-11-10 15:06:14,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:06:14,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 15:06:14,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:14,112 INFO L225 Difference]: With dead ends: 39 [2024-11-10 15:06:14,112 INFO L226 Difference]: Without dead ends: 39 [2024-11-10 15:06:14,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:06:14,114 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:14,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 66 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:06:14,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-10 15:06:14,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-10 15:06:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 35 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:06:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2024-11-10 15:06:14,126 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 5 [2024-11-10 15:06:14,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:14,126 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-11-10 15:06:14,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:06:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2024-11-10 15:06:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 15:06:14,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:14,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 15:06:14,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:06:14,128 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-10 15:06:14,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:14,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2018060292, now seen corresponding path program 1 times [2024-11-10 15:06:14,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:14,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373882918] [2024-11-10 15:06:14,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:14,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:14,157 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 15:06:14,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:14,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373882918] [2024-11-10 15:06:14,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373882918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:06:14,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:06:14,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:06:14,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008951115] [2024-11-10 15:06:14,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:06:14,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:06:14,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:14,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:06:14,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:06:14,160 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:06:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:14,192 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2024-11-10 15:06:14,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:06:14,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-10 15:06:14,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:14,195 INFO L225 Difference]: With dead ends: 43 [2024-11-10 15:06:14,195 INFO L226 Difference]: Without dead ends: 41 [2024-11-10 15:06:14,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:06:14,196 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:14,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:06:14,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-10 15:06:14,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-10 15:06:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.5) internal successors, (39), 37 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:06:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2024-11-10 15:06:14,207 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 6 [2024-11-10 15:06:14,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:14,207 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2024-11-10 15:06:14,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:06:14,208 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2024-11-10 15:06:14,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 15:06:14,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:14,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:14,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:06:14,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting recErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-10 15:06:14,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:14,212 INFO L85 PathProgramCache]: Analyzing trace with hash 979171891, now seen corresponding path program 1 times [2024-11-10 15:06:14,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:14,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128624766] [2024-11-10 15:06:14,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:14,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:14,323 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 15:06:14,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:14,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128624766] [2024-11-10 15:06:14,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128624766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:06:14,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:06:14,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:06:14,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000544209] [2024-11-10 15:06:14,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:06:14,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:06:14,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:14,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:06:14,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:06:14,328 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 15:06:14,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:14,423 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-11-10 15:06:14,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:06:14,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2024-11-10 15:06:14,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:14,424 INFO L225 Difference]: With dead ends: 36 [2024-11-10 15:06:14,426 INFO L226 Difference]: Without dead ends: 36 [2024-11-10 15:06:14,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:06:14,428 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 32 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:14,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 51 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:06:14,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-10 15:06:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-10 15:06:14,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:06:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-11-10 15:06:14,437 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 9 [2024-11-10 15:06:14,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:14,437 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-11-10 15:06:14,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 15:06:14,437 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-11-10 15:06:14,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 15:06:14,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:14,439 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:14,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:06:14,439 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting recErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-10 15:06:14,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:14,440 INFO L85 PathProgramCache]: Analyzing trace with hash 979171892, now seen corresponding path program 1 times [2024-11-10 15:06:14,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:14,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379627125] [2024-11-10 15:06:14,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:14,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:14,613 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 15:06:14,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:14,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379627125] [2024-11-10 15:06:14,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379627125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:06:14,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:06:14,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:06:14,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770826018] [2024-11-10 15:06:14,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:06:14,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:06:14,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:14,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:06:14,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:06:14,619 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 15:06:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:14,692 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-11-10 15:06:14,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:06:14,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2024-11-10 15:06:14,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:14,695 INFO L225 Difference]: With dead ends: 33 [2024-11-10 15:06:14,695 INFO L226 Difference]: Without dead ends: 33 [2024-11-10 15:06:14,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:06:14,697 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 28 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:14,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 57 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:06:14,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-10 15:06:14,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-11-10 15:06:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:06:14,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2024-11-10 15:06:14,709 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 9 [2024-11-10 15:06:14,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:14,709 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2024-11-10 15:06:14,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 15:06:14,710 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2024-11-10 15:06:14,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 15:06:14,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:14,710 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:14,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:06:14,711 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting recErr5ASSERT_VIOLATIONMEMORY_FREE === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-10 15:06:14,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:14,711 INFO L85 PathProgramCache]: Analyzing trace with hash -783347069, now seen corresponding path program 1 times [2024-11-10 15:06:14,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:14,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373373669] [2024-11-10 15:06:14,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:14,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:14,800 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 15:06:14,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:14,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373373669] [2024-11-10 15:06:14,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373373669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:06:14,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:06:14,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:06:14,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963885184] [2024-11-10 15:06:14,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:06:14,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:06:14,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:14,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:06:14,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:06:14,806 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 15:06:14,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:14,870 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-11-10 15:06:14,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:06:14,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 14 [2024-11-10 15:06:14,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:14,874 INFO L225 Difference]: With dead ends: 32 [2024-11-10 15:06:14,874 INFO L226 Difference]: Without dead ends: 32 [2024-11-10 15:06:14,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:06:14,875 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:14,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 48 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:06:14,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-10 15:06:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-10 15:06:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 15:06:14,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-11-10 15:06:14,885 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 14 [2024-11-10 15:06:14,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:14,885 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-10 15:06:14,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 15:06:14,886 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-11-10 15:06:14,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 15:06:14,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:06:14,887 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:14,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:06:14,888 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-10 15:06:14,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:06:14,889 INFO L85 PathProgramCache]: Analyzing trace with hash 765251942, now seen corresponding path program 1 times [2024-11-10 15:06:14,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:06:14,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978102239] [2024-11-10 15:06:14,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:06:14,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:06:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:15,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 15:06:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:06:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:06:15,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:06:15,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978102239] [2024-11-10 15:06:15,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978102239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:06:15,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:06:15,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 15:06:15,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494925900] [2024-11-10 15:06:15,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:06:15,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:06:15,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:06:15,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:06:15,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:06:15,182 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:06:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:06:15,261 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-11-10 15:06:15,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 15:06:15,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-10 15:06:15,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:06:15,262 INFO L225 Difference]: With dead ends: 29 [2024-11-10 15:06:15,262 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 15:06:15,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 15:06:15,264 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:06:15,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 66 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:06:15,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 15:06:15,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 15:06:15,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:06:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 15:06:15,265 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2024-11-10 15:06:15,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:06:15,265 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 15:06:15,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:06:15,266 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 15:06:15,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 15:06:15,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2024-11-10 15:06:15,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2024-11-10 15:06:15,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2024-11-10 15:06:15,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2024-11-10 15:06:15,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr4ASSERT_VIOLATIONMEMORY_FREE (9 of 14 remaining) [2024-11-10 15:06:15,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr5ASSERT_VIOLATIONMEMORY_FREE (8 of 14 remaining) [2024-11-10 15:06:15,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr6ASSERT_VIOLATIONMEMORY_FREE (7 of 14 remaining) [2024-11-10 15:06:15,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2024-11-10 15:06:15,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2024-11-10 15:06:15,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2024-11-10 15:06:15,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location recErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2024-11-10 15:06:15,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 14 remaining) [2024-11-10 15:06:15,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2024-11-10 15:06:15,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 14 remaining) [2024-11-10 15:06:15,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:06:15,277 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:06:15,279 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 15:06:15,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:06:15 BoogieIcfgContainer [2024-11-10 15:06:15,283 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 15:06:15,284 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 15:06:15,284 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 15:06:15,284 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 15:06:15,284 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:06:13" (3/4) ... [2024-11-10 15:06:15,286 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 15:06:15,290 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure rec [2024-11-10 15:06:15,296 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-10 15:06:15,296 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-10 15:06:15,296 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-10 15:06:15,297 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 15:06:15,386 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 15:06:15,387 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 15:06:15,387 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 15:06:15,387 INFO L158 Benchmark]: Toolchain (without parser) took 2619.70ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 72.6MB in the beginning and 93.1MB in the end (delta: -20.5MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-11-10 15:06:15,388 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 127.9MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:06:15,388 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.19ms. Allocated memory is still 127.9MB. Free memory was 72.3MB in the beginning and 60.6MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 15:06:15,388 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.46ms. Allocated memory is still 127.9MB. Free memory was 60.6MB in the beginning and 59.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:06:15,388 INFO L158 Benchmark]: Boogie Preprocessor took 52.33ms. Allocated memory is still 127.9MB. Free memory was 59.3MB in the beginning and 99.9MB in the end (delta: -40.6MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-11-10 15:06:15,389 INFO L158 Benchmark]: IcfgBuilder took 330.51ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 99.8MB in the beginning and 125.2MB in the end (delta: -25.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 15:06:15,389 INFO L158 Benchmark]: TraceAbstraction took 1869.08ms. Allocated memory is still 161.5MB. Free memory was 124.1MB in the beginning and 97.3MB in the end (delta: 26.8MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2024-11-10 15:06:15,389 INFO L158 Benchmark]: Witness Printer took 103.25ms. Allocated memory is still 161.5MB. Free memory was 97.3MB in the beginning and 93.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 15:06:15,390 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.22ms. Allocated memory is still 127.9MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.19ms. Allocated memory is still 127.9MB. Free memory was 72.3MB in the beginning and 60.6MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.46ms. Allocated memory is still 127.9MB. Free memory was 60.6MB in the beginning and 59.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.33ms. Allocated memory is still 127.9MB. Free memory was 59.3MB in the beginning and 99.9MB in the end (delta: -40.6MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * IcfgBuilder took 330.51ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 99.8MB in the beginning and 125.2MB in the end (delta: -25.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1869.08ms. Allocated memory is still 161.5MB. Free memory was 124.1MB in the beginning and 97.3MB in the end (delta: 26.8MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * Witness Printer took 103.25ms. Allocated memory is still 161.5MB. Free memory was 97.3MB in the beginning and 93.1MB in the end (delta: 4.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 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 11]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 11]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 418 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 212 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 252 IncrementalHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 206 mSDtfsCounter, 252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 33, 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, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 2/2 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 - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 15:06:15,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE