./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.01-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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-memory-alloca/b.01-alloca.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 06eda88bcf58fadc282f0463569ac76abefe45f388be92897534a5e4ca080960 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:36:34,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:36:35,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-09 07:36:35,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:36:35,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:36:35,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:36:35,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:36:35,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:36:35,056 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:36:35,056 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:36:35,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:36:35,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:36:35,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:36:35,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:36:35,058 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:36:35,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:36:35,058 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:36:35,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:36:35,059 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:36:35,059 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:36:35,059 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:36:35,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:36:35,060 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:36:35,060 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:36:35,061 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:36:35,061 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:36:35,061 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:36:35,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:36:35,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:36:35,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:36:35,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:36:35,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:36:35,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:36:35,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:36:35,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:36:35,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:36:35,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:36:35,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:36:35,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:36:35,065 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 -> 06eda88bcf58fadc282f0463569ac76abefe45f388be92897534a5e4ca080960 [2024-11-09 07:36:35,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:36:35,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:36:35,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:36:35,269 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:36:35,270 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:36:35,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.01-alloca.i [2024-11-09 07:36:37,017 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:36:37,203 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:36:37,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.01-alloca.i [2024-11-09 07:36:37,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d894c5cc9/d3ce6f8cf8e846f3a9dc4e13178e8dac/FLAGc4a8f4d0d [2024-11-09 07:36:37,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d894c5cc9/d3ce6f8cf8e846f3a9dc4e13178e8dac [2024-11-09 07:36:37,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:36:37,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:36:37,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:36:37,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:36:37,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:36:37,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:36:37" (1/1) ... [2024-11-09 07:36:37,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f6f836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:37, skipping insertion in model container [2024-11-09 07:36:37,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:36:37" (1/1) ... [2024-11-09 07:36:37,633 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:36:37,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:36:37,874 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:36:37,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:36:37,960 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:36:37,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:37 WrapperNode [2024-11-09 07:36:37,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:36:37,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:36:37,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:36:37,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:36:37,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:37" (1/1) ... [2024-11-09 07:36:37,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:37" (1/1) ... [2024-11-09 07:36:38,000 INFO L138 Inliner]: procedures = 111, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2024-11-09 07:36:38,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:36:38,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:36:38,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:36:38,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:36:38,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:37" (1/1) ... [2024-11-09 07:36:38,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:37" (1/1) ... [2024-11-09 07:36:38,018 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:37" (1/1) ... [2024-11-09 07:36:38,037 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [4, 2, 2]. 50 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 [2, 1, 1]. [2024-11-09 07:36:38,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:37" (1/1) ... [2024-11-09 07:36:38,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:37" (1/1) ... [2024-11-09 07:36:38,050 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:37" (1/1) ... [2024-11-09 07:36:38,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:37" (1/1) ... [2024-11-09 07:36:38,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:37" (1/1) ... [2024-11-09 07:36:38,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:37" (1/1) ... [2024-11-09 07:36:38,064 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:36:38,067 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:36:38,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:36:38,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:36:38,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:37" (1/1) ... [2024-11-09 07:36:38,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:36:38,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:36:38,108 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-09 07:36:38,112 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-09 07:36:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:36:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:36:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 07:36:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:36:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:36:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 07:36:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:36:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:36:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:36:38,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:36:38,229 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:36:38,231 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:36:38,342 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-09 07:36:38,342 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:36:38,352 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:36:38,352 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 07:36:38,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:36:38 BoogieIcfgContainer [2024-11-09 07:36:38,353 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:36:38,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:36:38,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:36:38,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:36:38,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:36:37" (1/3) ... [2024-11-09 07:36:38,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114f1a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:36:38, skipping insertion in model container [2024-11-09 07:36:38,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:37" (2/3) ... [2024-11-09 07:36:38,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114f1a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:36:38, skipping insertion in model container [2024-11-09 07:36:38,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:36:38" (3/3) ... [2024-11-09 07:36:38,360 INFO L112 eAbstractionObserver]: Analyzing ICFG b.01-alloca.i [2024-11-09 07:36:38,373 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:36:38,373 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-11-09 07:36:38,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:36:38,411 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;@61c9c1e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:36:38,411 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-11-09 07:36:38,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 16 states have (on average 2.1875) internal successors, (35), 33 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-11-09 07:36:38,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:36:38,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:38,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:36:38,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-09 07:36:38,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:38,424 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-09 07:36:38,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:38,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827781891] [2024-11-09 07:36:38,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:38,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:38,798 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-09 07:36:38,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:38,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827781891] [2024-11-09 07:36:38,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827781891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:38,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:38,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:38,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292121837] [2024-11-09 07:36:38,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:38,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:38,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:38,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:38,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:38,835 INFO L87 Difference]: Start difference. First operand has 34 states, 16 states have (on average 2.1875) internal successors, (35), 33 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.5) internal successors, (3), 3 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-11-09 07:36:38,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:38,895 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2024-11-09 07:36:38,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:38,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-11-09 07:36:38,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:38,903 INFO L225 Difference]: With dead ends: 30 [2024-11-09 07:36:38,904 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 07:36:38,905 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-09 07:36:38,911 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:38,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 14 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:38,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 07:36:38,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 07:36:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 27 states have internal predecessors, (28), 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-09 07:36:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2024-11-09 07:36:38,951 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 3 [2024-11-09 07:36:38,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:38,952 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2024-11-09 07:36:38,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-11-09 07:36:38,952 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2024-11-09 07:36:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:36:38,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:38,953 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:36:38,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:36:38,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-09 07:36:38,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:38,954 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-09 07:36:38,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:38,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048142735] [2024-11-09 07:36:38,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:38,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:39,142 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-09 07:36:39,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:39,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048142735] [2024-11-09 07:36:39,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048142735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:39,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:39,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:39,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623623458] [2024-11-09 07:36:39,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:39,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:39,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:39,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:39,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:39,145 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-11-09 07:36:39,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:39,170 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2024-11-09 07:36:39,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:39,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-11-09 07:36:39,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:39,170 INFO L225 Difference]: With dead ends: 24 [2024-11-09 07:36:39,170 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 07:36:39,171 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-09 07:36:39,171 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:39,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 14 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:39,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 07:36:39,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 07:36:39,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.6) internal successors, (24), 23 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-11-09 07:36:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2024-11-09 07:36:39,181 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 3 [2024-11-09 07:36:39,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:39,181 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2024-11-09 07:36:39,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-11-09 07:36:39,182 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2024-11-09 07:36:39,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:36:39,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:39,182 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:36:39,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:36:39,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-09 07:36:39,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:39,185 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2024-11-09 07:36:39,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:39,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749635519] [2024-11-09 07:36:39,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:39,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:39,262 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-09 07:36:39,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:39,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749635519] [2024-11-09 07:36:39,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749635519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:39,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:39,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:39,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045890784] [2024-11-09 07:36:39,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:39,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:39,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:39,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:39,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:39,265 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:39,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:39,287 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2024-11-09 07:36:39,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:39,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 07:36:39,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:39,289 INFO L225 Difference]: With dead ends: 22 [2024-11-09 07:36:39,289 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 07:36:39,290 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-09 07:36:39,291 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:39,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 9 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 07:36:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 07:36:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 21 states have internal predecessors, (22), 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-09 07:36:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2024-11-09 07:36:39,296 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 4 [2024-11-09 07:36:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:39,297 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2024-11-09 07:36:39,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2024-11-09 07:36:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:36:39,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:39,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:36:39,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:36:39,299 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-09 07:36:39,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:39,300 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2024-11-09 07:36:39,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:39,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176930315] [2024-11-09 07:36:39,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:39,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:39,383 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-09 07:36:39,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:39,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176930315] [2024-11-09 07:36:39,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176930315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:39,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:39,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:39,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302700469] [2024-11-09 07:36:39,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:39,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:39,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:39,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:39,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:39,386 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:39,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:39,407 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2024-11-09 07:36:39,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:39,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 07:36:39,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:39,407 INFO L225 Difference]: With dead ends: 20 [2024-11-09 07:36:39,408 INFO L226 Difference]: Without dead ends: 20 [2024-11-09 07:36:39,408 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-09 07:36:39,409 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 12 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-11-09 07:36:39,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 12 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:39,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-09 07:36:39,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-09 07:36:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 19 states have internal predecessors, (20), 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-09 07:36:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2024-11-09 07:36:39,414 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 4 [2024-11-09 07:36:39,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:39,415 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2024-11-09 07:36:39,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:39,415 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2024-11-09 07:36:39,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:36:39,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:39,415 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:36:39,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:36:39,416 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-09 07:36:39,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:39,417 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2024-11-09 07:36:39,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:39,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645366604] [2024-11-09 07:36:39,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:39,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:39,446 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-09 07:36:39,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:39,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645366604] [2024-11-09 07:36:39,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645366604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:39,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:39,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:39,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591077172] [2024-11-09 07:36:39,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:39,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:39,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:39,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:39,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:39,449 INFO L87 Difference]: Start difference. First operand 20 states and 20 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-09 07:36:39,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:39,470 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2024-11-09 07:36:39,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:39,471 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-09 07:36:39,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:39,472 INFO L225 Difference]: With dead ends: 18 [2024-11-09 07:36:39,472 INFO L226 Difference]: Without dead ends: 18 [2024-11-09 07:36:39,472 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-09 07:36:39,473 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:39,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 8 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:39,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-09 07:36:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-09 07:36:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 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-09 07:36:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2024-11-09 07:36:39,479 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 5 [2024-11-09 07:36:39,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:39,480 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2024-11-09 07:36:39,480 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-09 07:36:39,480 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2024-11-09 07:36:39,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:36:39,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:39,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:36:39,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:36:39,481 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-09 07:36:39,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:39,483 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2024-11-09 07:36:39,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:39,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089185823] [2024-11-09 07:36:39,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:39,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:39,546 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-09 07:36:39,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:39,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089185823] [2024-11-09 07:36:39,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089185823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:39,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:39,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:39,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235666854] [2024-11-09 07:36:39,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:39,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:39,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:39,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:39,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:39,549 INFO L87 Difference]: Start difference. First operand 18 states and 18 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-09 07:36:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:39,569 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-11-09 07:36:39,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:39,570 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-09 07:36:39,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:39,571 INFO L225 Difference]: With dead ends: 16 [2024-11-09 07:36:39,573 INFO L226 Difference]: Without dead ends: 16 [2024-11-09 07:36:39,573 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-09 07:36:39,574 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:39,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:39,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-09 07:36:39,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-09 07:36:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-09 07:36:39,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-11-09 07:36:39,581 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 5 [2024-11-09 07:36:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:39,581 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-11-09 07:36:39,581 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-09 07:36:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-11-09 07:36:39,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:36:39,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:39,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:39,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:36:39,584 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-11-09 07:36:39,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:39,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2048829865, now seen corresponding path program 1 times [2024-11-09 07:36:39,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:39,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103053018] [2024-11-09 07:36:39,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:39,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:39,785 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-09 07:36:39,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:39,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103053018] [2024-11-09 07:36:39,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103053018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:39,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:39,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:36:39,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138099380] [2024-11-09 07:36:39,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:39,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:36:39,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:39,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:36:39,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:36:39,786 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:39,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:39,806 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-09 07:36:39,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:36:39,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 07:36:39,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:39,807 INFO L225 Difference]: With dead ends: 15 [2024-11-09 07:36:39,807 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 07:36:39,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:36:39,808 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 9 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:39,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 9 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:39,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 07:36:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 07:36:39,809 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-09 07:36:39,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 07:36:39,809 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2024-11-09 07:36:39,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:39,809 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 07:36:39,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 07:36:39,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 07:36:39,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2024-11-09 07:36:39,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2024-11-09 07:36:39,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2024-11-09 07:36:39,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2024-11-09 07:36:39,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2024-11-09 07:36:39,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2024-11-09 07:36:39,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2024-11-09 07:36:39,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2024-11-09 07:36:39,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2024-11-09 07:36:39,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2024-11-09 07:36:39,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2024-11-09 07:36:39,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2024-11-09 07:36:39,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2024-11-09 07:36:39,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2024-11-09 07:36:39,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2024-11-09 07:36:39,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2024-11-09 07:36:39,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2024-11-09 07:36:39,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:36:39,815 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:39,817 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:36:39,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:36:39 BoogieIcfgContainer [2024-11-09 07:36:39,819 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:36:39,820 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:36:39,820 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:36:39,820 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:36:39,820 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:36:38" (3/4) ... [2024-11-09 07:36:39,822 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:36:39,828 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-09 07:36:39,828 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 07:36:39,828 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 07:36:39,828 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 07:36:39,886 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:36:39,886 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 07:36:39,886 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:36:39,886 INFO L158 Benchmark]: Toolchain (without parser) took 2302.65ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 86.4MB in the beginning and 64.5MB in the end (delta: 21.9MB). Peak memory consumption was 82.6MB. Max. memory is 16.1GB. [2024-11-09 07:36:39,886 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory was 109.9MB in the beginning and 109.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:36:39,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.19ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 86.3MB in the beginning and 190.2MB in the end (delta: -103.9MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2024-11-09 07:36:39,887 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.91ms. Allocated memory is still 220.2MB. Free memory was 190.2MB in the beginning and 187.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:36:39,887 INFO L158 Benchmark]: Boogie Preprocessor took 61.57ms. Allocated memory is still 220.2MB. Free memory was 187.9MB in the beginning and 186.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:36:39,887 INFO L158 Benchmark]: RCFGBuilder took 286.32ms. Allocated memory is still 220.2MB. Free memory was 186.0MB in the beginning and 170.3MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 07:36:39,887 INFO L158 Benchmark]: TraceAbstraction took 1464.40ms. Allocated memory is still 220.2MB. Free memory was 170.3MB in the beginning and 69.8MB in the end (delta: 100.5MB). Peak memory consumption was 98.4MB. Max. memory is 16.1GB. [2024-11-09 07:36:39,887 INFO L158 Benchmark]: Witness Printer took 66.32ms. Allocated memory is still 220.2MB. Free memory was 69.8MB in the beginning and 64.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 07:36:39,888 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory was 109.9MB in the beginning and 109.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.19ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 86.3MB in the beginning and 190.2MB in the end (delta: -103.9MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.91ms. Allocated memory is still 220.2MB. Free memory was 190.2MB in the beginning and 187.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.57ms. Allocated memory is still 220.2MB. Free memory was 187.9MB in the beginning and 186.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 286.32ms. Allocated memory is still 220.2MB. Free memory was 186.0MB in the beginning and 170.3MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1464.40ms. Allocated memory is still 220.2MB. Free memory was 170.3MB in the beginning and 69.8MB in the end (delta: 100.5MB). Peak memory consumption was 98.4MB. Max. memory is 16.1GB. * Witness Printer took 66.32ms. Allocated memory is still 220.2MB. Free memory was 69.8MB in the beginning and 64.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: 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, 34 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 118 IncrementalHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 66 mSDtfsCounter, 118 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred 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.8s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 29 ConstructedInterpolants, 0 QuantifiedInterpolants, 297 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 17 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 07:36:39,914 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