./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.05-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.05-alloca.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 5dfaa1e7d8e11d61c3d4d0b8b3724f22fd323b68a720b01bc26596e3781d27f8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:50:05,924 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:50:05,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-11 17:50:05,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:50:05,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:50:06,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:50:06,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:50:06,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:50:06,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:50:06,021 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:50:06,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:50:06,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:50:06,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:50:06,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:50:06,024 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:50:06,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:50:06,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:50:06,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:50:06,025 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:50:06,025 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:50:06,026 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:50:06,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:50:06,028 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:50:06,029 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:50:06,029 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:50:06,029 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:50:06,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:50:06,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:50:06,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:50:06,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:50:06,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:50:06,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:50:06,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:50:06,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:50:06,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:50:06,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:50:06,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:50:06,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:50:06,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:50:06,031 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-clean/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-clean/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 -> 5dfaa1e7d8e11d61c3d4d0b8b3724f22fd323b68a720b01bc26596e3781d27f8 [2024-10-11 17:50:06,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:50:06,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:50:06,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:50:06,260 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:50:06,260 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:50:06,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.05-alloca.i [2024-10-11 17:50:07,495 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:50:07,691 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:50:07,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.05-alloca.i [2024-10-11 17:50:07,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/dde47d83a/d615ebdbf24b4107a942b578564e548c/FLAG355b52ec8 [2024-10-11 17:50:07,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/dde47d83a/d615ebdbf24b4107a942b578564e548c [2024-10-11 17:50:07,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:50:07,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:50:07,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:50:07,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:50:07,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:50:07,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:50:07" (1/1) ... [2024-10-11 17:50:07,729 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d058dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:07, skipping insertion in model container [2024-10-11 17:50:07,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:50:07" (1/1) ... [2024-10-11 17:50:07,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:50:07,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:50:07,980 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:50:08,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:50:08,033 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:50:08,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:08 WrapperNode [2024-10-11 17:50:08,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:50:08,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:50:08,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:50:08,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:50:08,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:08" (1/1) ... [2024-10-11 17:50:08,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:08" (1/1) ... [2024-10-11 17:50:08,069 INFO L138 Inliner]: procedures = 111, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-10-11 17:50:08,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:50:08,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:50:08,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:50:08,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:50:08,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:08" (1/1) ... [2024-10-11 17:50:08,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:08" (1/1) ... [2024-10-11 17:50:08,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:08" (1/1) ... [2024-10-11 17:50:08,096 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 5, 2]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 4 writes are split as follows [1, 2, 1]. [2024-10-11 17:50:08,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:08" (1/1) ... [2024-10-11 17:50:08,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:08" (1/1) ... [2024-10-11 17:50:08,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:08" (1/1) ... [2024-10-11 17:50:08,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:08" (1/1) ... [2024-10-11 17:50:08,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:08" (1/1) ... [2024-10-11 17:50:08,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:08" (1/1) ... [2024-10-11 17:50:08,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:50:08,115 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:50:08,115 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:50:08,115 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:50:08,116 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:08" (1/1) ... [2024-10-11 17:50:08,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:50:08,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:50:08,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:50:08,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:50:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 17:50:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 17:50:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 17:50:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 17:50:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 17:50:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 17:50:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:50:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:50:08,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:50:08,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:50:08,264 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:50:08,266 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:50:08,422 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-10-11 17:50:08,422 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:50:08,453 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:50:08,454 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 17:50:08,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:50:08 BoogieIcfgContainer [2024-10-11 17:50:08,455 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:50:08,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:50:08,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:50:08,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:50:08,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:50:07" (1/3) ... [2024-10-11 17:50:08,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33019d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:50:08, skipping insertion in model container [2024-10-11 17:50:08,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:50:08" (2/3) ... [2024-10-11 17:50:08,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33019d98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:50:08, skipping insertion in model container [2024-10-11 17:50:08,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:50:08" (3/3) ... [2024-10-11 17:50:08,461 INFO L112 eAbstractionObserver]: Analyzing ICFG a.05-alloca.i [2024-10-11 17:50:08,473 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:50:08,473 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2024-10-11 17:50:08,507 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:50:08,512 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;@14f6eb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:50:08,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-10-11 17:50:08,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 32 states have internal predecessors, (35), 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-10-11 17:50:08,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 17:50:08,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:50:08,520 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 17:50:08,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:50:08,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:50:08,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2794, now seen corresponding path program 1 times [2024-10-11 17:50:08,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:50:08,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862678661] [2024-10-11 17:50:08,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:50:08,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:50:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:50:08,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:50:08,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:50:08,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862678661] [2024-10-11 17:50:08,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862678661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:50:08,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:50:08,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:50:08,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365809135] [2024-10-11 17:50:08,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:50:08,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:50:08,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:50:08,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:50:08,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:50:08,820 INFO L87 Difference]: Start difference. First operand has 33 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 32 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:50:08,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:50:08,858 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-10-11 17:50:08,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:50:08,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-11 17:50:08,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:50:08,866 INFO L225 Difference]: With dead ends: 31 [2024-10-11 17:50:08,866 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 17:50:08,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:50:08,871 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:50:08,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 12 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:50:08,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 17:50:08,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-11 17:50:08,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 29 states have internal predecessors, (31), 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-10-11 17:50:08,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-10-11 17:50:08,894 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 2 [2024-10-11 17:50:08,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:50:08,894 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-10-11 17:50:08,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:50:08,894 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-10-11 17:50:08,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 17:50:08,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:50:08,894 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 17:50:08,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:50:08,895 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:50:08,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:50:08,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2795, now seen corresponding path program 1 times [2024-10-11 17:50:08,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:50:08,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124512075] [2024-10-11 17:50:08,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:50:08,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:50:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:50:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:50:09,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:50:09,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124512075] [2024-10-11 17:50:09,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124512075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:50:09,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:50:09,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:50:09,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104000994] [2024-10-11 17:50:09,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:50:09,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:50:09,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:50:09,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:50:09,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:50:09,020 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:50:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:50:09,056 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-10-11 17:50:09,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:50:09,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-11 17:50:09,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:50:09,058 INFO L225 Difference]: With dead ends: 28 [2024-10-11 17:50:09,058 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 17:50:09,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:50:09,059 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:50:09,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 13 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:50:09,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 17:50:09,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-11 17:50:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 13 states have (on average 2.230769230769231) internal successors, (29), 27 states have internal predecessors, (29), 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-10-11 17:50:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2024-10-11 17:50:09,063 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 2 [2024-10-11 17:50:09,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:50:09,063 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-10-11 17:50:09,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:50:09,063 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2024-10-11 17:50:09,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 17:50:09,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:50:09,063 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 17:50:09,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:50:09,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:50:09,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:50:09,065 INFO L85 PathProgramCache]: Analyzing trace with hash 86590, now seen corresponding path program 1 times [2024-10-11 17:50:09,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:50:09,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66058938] [2024-10-11 17:50:09,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:50:09,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:50:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:50:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:50:09,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:50:09,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66058938] [2024-10-11 17:50:09,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66058938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:50:09,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:50:09,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:50:09,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046635838] [2024-10-11 17:50:09,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:50:09,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:50:09,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:50:09,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:50:09,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:50:09,139 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-10-11 17:50:09,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:50:09,180 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2024-10-11 17:50:09,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:50:09,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-10-11 17:50:09,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:50:09,182 INFO L225 Difference]: With dead ends: 23 [2024-10-11 17:50:09,182 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 17:50:09,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:50:09,183 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:50:09,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 7 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:50:09,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 17:50:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-11 17:50:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:50:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-10-11 17:50:09,187 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 3 [2024-10-11 17:50:09,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:50:09,187 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-10-11 17:50:09,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-10-11 17:50:09,187 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-10-11 17:50:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 17:50:09,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:50:09,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 17:50:09,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:50:09,188 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:50:09,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:50:09,188 INFO L85 PathProgramCache]: Analyzing trace with hash 86591, now seen corresponding path program 1 times [2024-10-11 17:50:09,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:50:09,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793017889] [2024-10-11 17:50:09,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:50:09,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:50:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:50:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:50:09,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:50:09,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793017889] [2024-10-11 17:50:09,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793017889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:50:09,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:50:09,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:50:09,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524204708] [2024-10-11 17:50:09,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:50:09,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:50:09,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:50:09,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:50:09,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:50:09,273 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-10-11 17:50:09,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:50:09,297 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-10-11 17:50:09,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:50:09,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-10-11 17:50:09,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:50:09,298 INFO L225 Difference]: With dead ends: 18 [2024-10-11 17:50:09,298 INFO L226 Difference]: Without dead ends: 18 [2024-10-11 17:50:09,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:50:09,299 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 15 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:50:09,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 8 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:50:09,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-11 17:50:09,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-11 17:50:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:50:09,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-10-11 17:50:09,302 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 3 [2024-10-11 17:50:09,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:50:09,302 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-10-11 17:50:09,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-10-11 17:50:09,302 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-10-11 17:50:09,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:50:09,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:50:09,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:50:09,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:50:09,303 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:50:09,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:50:09,303 INFO L85 PathProgramCache]: Analyzing trace with hash 2684269, now seen corresponding path program 1 times [2024-10-11 17:50:09,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:50:09,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577694020] [2024-10-11 17:50:09,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:50:09,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:50:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:50:09,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:50:09,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:50:09,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577694020] [2024-10-11 17:50:09,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577694020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:50:09,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:50:09,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:50:09,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488169481] [2024-10-11 17:50:09,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:50:09,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:50:09,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:50:09,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:50:09,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:50:09,365 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:50:09,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:50:09,405 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2024-10-11 17:50:09,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:50:09,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 17:50:09,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:50:09,407 INFO L225 Difference]: With dead ends: 16 [2024-10-11 17:50:09,407 INFO L226 Difference]: Without dead ends: 16 [2024-10-11 17:50:09,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:50:09,408 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:50:09,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:50:09,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-10-11 17:50:09,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-11 17:50:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:50:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-10-11 17:50:09,414 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 4 [2024-10-11 17:50:09,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:50:09,414 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-10-11 17:50:09,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:50:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-10-11 17:50:09,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:50:09,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:50:09,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:50:09,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:50:09,416 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:50:09,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:50:09,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2684270, now seen corresponding path program 1 times [2024-10-11 17:50:09,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:50:09,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216641420] [2024-10-11 17:50:09,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:50:09,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:50:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:50:09,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:50:09,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:50:09,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216641420] [2024-10-11 17:50:09,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216641420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:50:09,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:50:09,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:50:09,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734483802] [2024-10-11 17:50:09,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:50:09,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:50:09,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:50:09,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:50:09,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:50:09,481 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:50:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:50:09,499 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2024-10-11 17:50:09,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:50:09,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 17:50:09,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:50:09,499 INFO L225 Difference]: With dead ends: 14 [2024-10-11 17:50:09,499 INFO L226 Difference]: Without dead ends: 14 [2024-10-11 17:50:09,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:50:09,500 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:50:09,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 6 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:50:09,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-11 17:50:09,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-11 17:50:09,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:50:09,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-10-11 17:50:09,503 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 4 [2024-10-11 17:50:09,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:50:09,503 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-10-11 17:50:09,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:50:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-10-11 17:50:09,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 17:50:09,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:50:09,504 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:50:09,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:50:09,504 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:50:09,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:50:09,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1476789904, now seen corresponding path program 1 times [2024-10-11 17:50:09,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:50:09,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686958538] [2024-10-11 17:50:09,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:50:09,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:50:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:50:09,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:50:09,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:50:09,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686958538] [2024-10-11 17:50:09,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686958538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:50:09,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:50:09,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:50:09,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459303438] [2024-10-11 17:50:09,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:50:09,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:50:09,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:50:09,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:50:09,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:50:09,674 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-10-11 17:50:09,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:50:09,694 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-10-11 17:50:09,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:50:09,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2024-10-11 17:50:09,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:50:09,695 INFO L225 Difference]: With dead ends: 13 [2024-10-11 17:50:09,695 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 17:50:09,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:50:09,696 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:50:09,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 8 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:50:09,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 17:50:09,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 17:50:09,697 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-10-11 17:50:09,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 17:50:09,697 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2024-10-11 17:50:09,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:50:09,697 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 17:50:09,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-10-11 17:50:09,697 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 17:50:09,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 17:50:09,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 19 remaining) [2024-10-11 17:50:09,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 19 remaining) [2024-10-11 17:50:09,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 19 remaining) [2024-10-11 17:50:09,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 19 remaining) [2024-10-11 17:50:09,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 19 remaining) [2024-10-11 17:50:09,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 19 remaining) [2024-10-11 17:50:09,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 19 remaining) [2024-10-11 17:50:09,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 19 remaining) [2024-10-11 17:50:09,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 19 remaining) [2024-10-11 17:50:09,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 19 remaining) [2024-10-11 17:50:09,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 19 remaining) [2024-10-11 17:50:09,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 19 remaining) [2024-10-11 17:50:09,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 19 remaining) [2024-10-11 17:50:09,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 19 remaining) [2024-10-11 17:50:09,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 19 remaining) [2024-10-11 17:50:09,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 19 remaining) [2024-10-11 17:50:09,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 19 remaining) [2024-10-11 17:50:09,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 19 remaining) [2024-10-11 17:50:09,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (0 of 19 remaining) [2024-10-11 17:50:09,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:50:09,707 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:50:09,709 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:50:09,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:50:09 BoogieIcfgContainer [2024-10-11 17:50:09,713 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:50:09,714 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:50:09,714 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:50:09,714 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:50:09,715 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:50:08" (3/4) ... [2024-10-11 17:50:09,716 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:50:09,722 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-11 17:50:09,723 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:50:09,723 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 17:50:09,723 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 17:50:09,790 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:50:09,790 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:50:09,790 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:50:09,790 INFO L158 Benchmark]: Toolchain (without parser) took 2069.35ms. Allocated memory was 146.8MB in the beginning and 203.4MB in the end (delta: 56.6MB). Free memory was 90.3MB in the beginning and 110.5MB in the end (delta: -20.2MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2024-10-11 17:50:09,791 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory was 109.2MB in the beginning and 109.0MB in the end (delta: 178.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:50:09,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.72ms. Allocated memory is still 146.8MB. Free memory was 89.9MB in the beginning and 72.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 17:50:09,791 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.34ms. Allocated memory is still 146.8MB. Free memory was 72.3MB in the beginning and 70.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:50:09,791 INFO L158 Benchmark]: Boogie Preprocessor took 44.65ms. Allocated memory is still 146.8MB. Free memory was 70.6MB in the beginning and 68.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:50:09,791 INFO L158 Benchmark]: RCFGBuilder took 339.48ms. Allocated memory was 146.8MB in the beginning and 203.4MB in the end (delta: 56.6MB). Free memory was 68.5MB in the beginning and 169.3MB in the end (delta: -100.9MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-10-11 17:50:09,791 INFO L158 Benchmark]: TraceAbstraction took 1257.39ms. Allocated memory is still 203.4MB. Free memory was 168.4MB in the beginning and 114.7MB in the end (delta: 53.7MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2024-10-11 17:50:09,792 INFO L158 Benchmark]: Witness Printer took 76.22ms. Allocated memory is still 203.4MB. Free memory was 114.7MB in the beginning and 110.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:50:09,793 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.15ms. Allocated memory is still 146.8MB. Free memory was 109.2MB in the beginning and 109.0MB in the end (delta: 178.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.72ms. Allocated memory is still 146.8MB. Free memory was 89.9MB in the beginning and 72.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.34ms. Allocated memory is still 146.8MB. Free memory was 72.3MB in the beginning and 70.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.65ms. Allocated memory is still 146.8MB. Free memory was 70.6MB in the beginning and 68.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 339.48ms. Allocated memory was 146.8MB in the beginning and 203.4MB in the end (delta: 56.6MB). Free memory was 68.5MB in the beginning and 169.3MB in the end (delta: -100.9MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1257.39ms. Allocated memory is still 203.4MB. Free memory was 168.4MB in the beginning and 114.7MB in the end (delta: 53.7MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. * Witness Printer took 76.22ms. Allocated memory is still 203.4MB. Free memory was 114.7MB in the beginning and 110.5MB 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: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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: 560]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 19 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 127 IncrementalHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 52 mSDtfsCounter, 127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 262 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:50:09,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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