./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.02-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.02-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 854590cc4413a89873a976feacf89528edce1772c9b07a52d61540a880295e5a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:36:38,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:36:38,496 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:38,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:36:38,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:36:38,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:36:38,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:36:38,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:36:38,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:36:38,540 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:36:38,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:36:38,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:36:38,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:36:38,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:36:38,542 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:36:38,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:36:38,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:36:38,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:36:38,544 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:36:38,545 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:36:38,545 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:36:38,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:36:38,546 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:36:38,546 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:36:38,546 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:36:38,546 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:36:38,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:36:38,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:36:38,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:36:38,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:36:38,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:36:38,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:36:38,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:36:38,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:36:38,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:36:38,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:36:38,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:36:38,549 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:36:38,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:36:38,551 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 -> 854590cc4413a89873a976feacf89528edce1772c9b07a52d61540a880295e5a [2024-11-09 07:36:38,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:36:38,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:36:38,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:36:38,852 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:36:38,852 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:36:38,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.02-alloca.i [2024-11-09 07:36:40,348 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:36:40,570 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:36:40,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.02-alloca.i [2024-11-09 07:36:40,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f845c90e0/80a3223426c543a197d47cf3c4a298b3/FLAGafae770ad [2024-11-09 07:36:40,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f845c90e0/80a3223426c543a197d47cf3c4a298b3 [2024-11-09 07:36:40,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:36:40,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:36:40,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:36:40,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:36:40,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:36:40,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:36:40" (1/1) ... [2024-11-09 07:36:40,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47d7a2dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:40, skipping insertion in model container [2024-11-09 07:36:40,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:36:40" (1/1) ... [2024-11-09 07:36:40,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:36:41,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:36:41,018 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:36:41,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:36:41,111 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:36:41,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:41 WrapperNode [2024-11-09 07:36:41,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:36:41,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:36:41,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:36:41,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:36:41,120 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:41" (1/1) ... [2024-11-09 07:36:41,132 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:41" (1/1) ... [2024-11-09 07:36:41,151 INFO L138 Inliner]: procedures = 111, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2024-11-09 07:36:41,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:36:41,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:36:41,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:36:41,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:36:41,163 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:41" (1/1) ... [2024-11-09 07:36:41,163 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:41" (1/1) ... [2024-11-09 07:36:41,165 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:41" (1/1) ... [2024-11-09 07:36:41,176 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [4, 2, 4]. 40 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 5 writes are split as follows [2, 1, 2]. [2024-11-09 07:36:41,177 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:41" (1/1) ... [2024-11-09 07:36:41,177 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:41" (1/1) ... [2024-11-09 07:36:41,184 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:41" (1/1) ... [2024-11-09 07:36:41,195 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:41" (1/1) ... [2024-11-09 07:36:41,196 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:41" (1/1) ... [2024-11-09 07:36:41,197 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:41" (1/1) ... [2024-11-09 07:36:41,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:36:41,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:36:41,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:36:41,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:36:41,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:41" (1/1) ... [2024-11-09 07:36:41,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:36:41,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:36:41,242 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:41,249 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:41,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:36:41,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:36:41,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 07:36:41,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:36:41,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:36:41,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 07:36:41,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:36:41,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:36:41,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:36:41,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:36:41,447 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:36:41,450 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:36:41,649 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2024-11-09 07:36:41,649 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:36:41,673 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:36:41,674 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 07:36:41,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:36:41 BoogieIcfgContainer [2024-11-09 07:36:41,675 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:36:41,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:36:41,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:36:41,682 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:36:41,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:36:40" (1/3) ... [2024-11-09 07:36:41,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30cbaec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:36:41, skipping insertion in model container [2024-11-09 07:36:41,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:36:41" (2/3) ... [2024-11-09 07:36:41,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30cbaec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:36:41, skipping insertion in model container [2024-11-09 07:36:41,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:36:41" (3/3) ... [2024-11-09 07:36:41,685 INFO L112 eAbstractionObserver]: Analyzing ICFG b.02-alloca.i [2024-11-09 07:36:41,704 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:36:41,704 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-11-09 07:36:41,741 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:36:41,748 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;@36fc4a70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:36:41,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-09 07:36:41,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 19 states have (on average 2.210526315789474) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:36:41,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:36:41,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:41,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:36:41,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:36:41,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:41,766 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-09 07:36:41,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:41,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505377110] [2024-11-09 07:36:41,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:41,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:42,207 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:42,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:42,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505377110] [2024-11-09 07:36:42,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505377110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:42,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:42,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:42,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341786479] [2024-11-09 07:36:42,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:42,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:42,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:42,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:42,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:42,290 INFO L87 Difference]: Start difference. First operand has 41 states, 19 states have (on average 2.210526315789474) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:42,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:42,372 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2024-11-09 07:36:42,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:42,375 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:42,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:42,382 INFO L225 Difference]: With dead ends: 37 [2024-11-09 07:36:42,382 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 07:36:42,384 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:42,390 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:42,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 17 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:36:42,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 07:36:42,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 07:36:42,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 34 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:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2024-11-09 07:36:42,420 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 3 [2024-11-09 07:36:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:42,420 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2024-11-09 07:36:42,421 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:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2024-11-09 07:36:42,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:36:42,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:42,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:36:42,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:36:42,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:36:42,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:42,422 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-09 07:36:42,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:42,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370923763] [2024-11-09 07:36:42,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:42,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:42,635 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:42,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:42,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370923763] [2024-11-09 07:36:42,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370923763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:42,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:42,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:42,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218442481] [2024-11-09 07:36:42,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:42,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:42,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:42,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:42,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:42,640 INFO L87 Difference]: Start difference. First operand 35 states and 35 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:42,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:42,679 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2024-11-09 07:36:42,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:42,680 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:42,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:42,680 INFO L225 Difference]: With dead ends: 31 [2024-11-09 07:36:42,681 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 07:36:42,681 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:42,682 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:42,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 17 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:42,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 07:36:42,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 07:36:42,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 30 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-11-09 07:36:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2024-11-09 07:36:42,691 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 3 [2024-11-09 07:36:42,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:42,691 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2024-11-09 07:36:42,691 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:42,691 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2024-11-09 07:36:42,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:36:42,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:42,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:36:42,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:36:42,692 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:36:42,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:42,694 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2024-11-09 07:36:42,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:42,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673767775] [2024-11-09 07:36:42,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:42,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:42,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-11-09 07:36:42,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:42,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673767775] [2024-11-09 07:36:42,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673767775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:42,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:42,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:42,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934988932] [2024-11-09 07:36:42,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:42,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:42,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:42,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:42,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:42,797 INFO L87 Difference]: Start difference. First operand 31 states and 31 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:42,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:42,844 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2024-11-09 07:36:42,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:42,844 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:42,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:42,845 INFO L225 Difference]: With dead ends: 27 [2024-11-09 07:36:42,845 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 07:36:42,845 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:42,846 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:42,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 10 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:42,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 07:36:42,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 07:36:42,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.5) internal successors, (27), 26 states have internal predecessors, (27), 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:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-09 07:36:42,853 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 4 [2024-11-09 07:36:42,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:42,854 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-09 07:36:42,854 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:42,854 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-09 07:36:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:36:42,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:42,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:36:42,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:36:42,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:36:42,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:42,858 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2024-11-09 07:36:42,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:42,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198376784] [2024-11-09 07:36:42,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:42,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:42,989 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:42,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:42,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198376784] [2024-11-09 07:36:42,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198376784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:42,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:42,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:42,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490142168] [2024-11-09 07:36:42,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:42,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:42,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:42,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:42,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:42,993 INFO L87 Difference]: Start difference. First operand 27 states and 27 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:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:43,022 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2024-11-09 07:36:43,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:43,023 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:43,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:43,023 INFO L225 Difference]: With dead ends: 23 [2024-11-09 07:36:43,024 INFO L226 Difference]: Without dead ends: 23 [2024-11-09 07:36:43,024 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:43,025 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 13 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:43,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 13 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:43,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-09 07:36:43,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-09 07:36:43,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 22 states have internal predecessors, (23), 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:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-11-09 07:36:43,030 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 4 [2024-11-09 07:36:43,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:43,030 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-11-09 07:36:43,030 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:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-11-09 07:36:43,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:36:43,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:43,031 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:36:43,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:36:43,031 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:36:43,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:43,032 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2024-11-09 07:36:43,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:43,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906755561] [2024-11-09 07:36:43,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:43,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:43,086 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:43,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:43,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906755561] [2024-11-09 07:36:43,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906755561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:43,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:43,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:43,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435721157] [2024-11-09 07:36:43,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:43,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:43,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:43,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:43,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:43,089 INFO L87 Difference]: Start difference. First operand 23 states and 23 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:43,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:43,127 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2024-11-09 07:36:43,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:43,128 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:43,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:43,128 INFO L225 Difference]: With dead ends: 21 [2024-11-09 07:36:43,129 INFO L226 Difference]: Without dead ends: 21 [2024-11-09 07:36:43,129 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:43,130 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 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:43,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 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:43,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-09 07:36:43,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-09 07:36:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 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:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-09 07:36:43,137 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 5 [2024-11-09 07:36:43,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:43,137 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-09 07:36:43,137 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:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-09 07:36:43,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:36:43,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:43,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:36:43,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:36:43,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:36:43,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:43,141 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2024-11-09 07:36:43,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:43,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337687554] [2024-11-09 07:36:43,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:43,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:43,213 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:43,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:43,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337687554] [2024-11-09 07:36:43,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337687554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:43,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:43,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:36:43,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747975390] [2024-11-09 07:36:43,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:43,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:36:43,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:43,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:36:43,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:36:43,215 INFO L87 Difference]: Start difference. First operand 21 states and 21 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:43,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:43,236 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2024-11-09 07:36:43,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:36:43,237 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:43,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:43,237 INFO L225 Difference]: With dead ends: 19 [2024-11-09 07:36:43,237 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 07:36:43,238 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:43,238 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:43,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 07:36:43,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-09 07:36:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 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-11-09 07:36:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2024-11-09 07:36:43,245 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 5 [2024-11-09 07:36:43,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:43,246 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2024-11-09 07:36:43,246 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:43,246 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2024-11-09 07:36:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:36:43,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:36:43,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:43,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:36:43,247 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:36:43,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:36:43,247 INFO L85 PathProgramCache]: Analyzing trace with hash -2048614377, now seen corresponding path program 1 times [2024-11-09 07:36:43,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:36:43,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315713695] [2024-11-09 07:36:43,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:36:43,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:36:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:36:43,523 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:43,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:36:43,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315713695] [2024-11-09 07:36:43,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315713695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:36:43,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:36:43,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:36:43,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604561039] [2024-11-09 07:36:43,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:36:43,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:36:43,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:36:43,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:36:43,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:36:43,527 INFO L87 Difference]: Start difference. First operand 19 states and 19 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:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:36:43,566 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2024-11-09 07:36:43,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:36:43,567 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:43,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:36:43,567 INFO L225 Difference]: With dead ends: 18 [2024-11-09 07:36:43,568 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 07:36:43,568 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:43,569 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:36:43,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 11 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:36:43,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 07:36:43,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 07:36:43,570 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:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 07:36:43,570 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2024-11-09 07:36:43,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:36:43,570 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 07:36:43,574 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:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 07:36:43,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 07:36:43,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2024-11-09 07:36:43,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2024-11-09 07:36:43,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2024-11-09 07:36:43,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2024-11-09 07:36:43,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2024-11-09 07:36:43,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2024-11-09 07:36:43,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2024-11-09 07:36:43,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2024-11-09 07:36:43,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2024-11-09 07:36:43,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2024-11-09 07:36:43,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2024-11-09 07:36:43,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2024-11-09 07:36:43,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2024-11-09 07:36:43,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2024-11-09 07:36:43,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2024-11-09 07:36:43,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2024-11-09 07:36:43,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2024-11-09 07:36:43,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2024-11-09 07:36:43,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 21 remaining) [2024-11-09 07:36:43,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 21 remaining) [2024-11-09 07:36:43,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2024-11-09 07:36:43,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:36:43,587 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:36:43,590 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:36:43,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:36:43 BoogieIcfgContainer [2024-11-09 07:36:43,595 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:36:43,595 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:36:43,596 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:36:43,596 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:36:43,596 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:41" (3/4) ... [2024-11-09 07:36:43,599 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:36:43,609 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-09 07:36:43,609 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 07:36:43,610 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 07:36:43,610 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 07:36:43,695 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:36:43,698 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 07:36:43,699 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:36:43,699 INFO L158 Benchmark]: Toolchain (without parser) took 3101.76ms. Allocated memory was 167.8MB in the beginning and 230.7MB in the end (delta: 62.9MB). Free memory was 92.2MB in the beginning and 175.8MB in the end (delta: -83.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:36:43,699 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 167.8MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:36:43,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.80ms. Allocated memory was 167.8MB in the beginning and 230.7MB in the end (delta: 62.9MB). Free memory was 92.0MB in the beginning and 197.2MB in the end (delta: -105.2MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-11-09 07:36:43,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.33ms. Allocated memory is still 230.7MB. Free memory was 197.2MB in the beginning and 195.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:36:43,700 INFO L158 Benchmark]: Boogie Preprocessor took 47.20ms. Allocated memory is still 230.7MB. Free memory was 195.2MB in the beginning and 194.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:36:43,701 INFO L158 Benchmark]: RCFGBuilder took 475.11ms. Allocated memory is still 230.7MB. Free memory was 194.1MB in the beginning and 177.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 07:36:43,701 INFO L158 Benchmark]: TraceAbstraction took 1917.48ms. Allocated memory is still 230.7MB. Free memory was 176.3MB in the beginning and 181.0MB in the end (delta: -4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:36:43,701 INFO L158 Benchmark]: Witness Printer took 103.19ms. Allocated memory is still 230.7MB. Free memory was 181.0MB in the beginning and 175.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:36:43,703 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.12ms. Allocated memory is still 167.8MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.80ms. Allocated memory was 167.8MB in the beginning and 230.7MB in the end (delta: 62.9MB). Free memory was 92.0MB in the beginning and 197.2MB in the end (delta: -105.2MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.33ms. Allocated memory is still 230.7MB. Free memory was 197.2MB in the beginning and 195.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.20ms. Allocated memory is still 230.7MB. Free memory was 195.2MB in the beginning and 194.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 475.11ms. Allocated memory is still 230.7MB. Free memory was 194.1MB in the beginning and 177.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1917.48ms. Allocated memory is still 230.7MB. Free memory was 176.3MB in the beginning and 181.0MB in the end (delta: -4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 103.19ms. Allocated memory is still 230.7MB. Free memory was 181.0MB in the beginning and 175.8MB in the end (delta: 5.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: -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: 561]: 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, 41 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 117 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 117 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 142 IncrementalHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 77 mSDtfsCounter, 142 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.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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, 1.0s 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 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 07:36:43,737 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