./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/aviad_true-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/aviad_true-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 da65a08be7a694e995d17e45362055fa5f60ddf40e08c5ba36204464b294ccf0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:33:44,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:33:44,534 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-13 10:33:44,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:33:44,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:33:44,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:33:44,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:33:44,569 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:33:44,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:33:44,570 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:33:44,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:33:44,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:33:44,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:33:44,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:33:44,572 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:33:44,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:33:44,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:33:44,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:33:44,573 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:33:44,574 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:33:44,574 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:33:44,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:33:44,575 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:33:44,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:33:44,575 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:33:44,576 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:33:44,576 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:33:44,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:33:44,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:33:44,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:33:44,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:33:44,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:33:44,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:33:44,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:33:44,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:33:44,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:33:44,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:33:44,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:33:44,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:33:44,580 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 -> da65a08be7a694e995d17e45362055fa5f60ddf40e08c5ba36204464b294ccf0 [2024-10-13 10:33:44,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:33:44,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:33:44,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:33:44,828 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:33:44,829 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:33:44,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/aviad_true-alloca.i [2024-10-13 10:33:46,244 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:33:46,487 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:33:46,487 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/aviad_true-alloca.i [2024-10-13 10:33:46,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db9f9fe47/d1bf208daa1e47719dec0ab276fb9e73/FLAG14798f1ed [2024-10-13 10:33:46,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db9f9fe47/d1bf208daa1e47719dec0ab276fb9e73 [2024-10-13 10:33:46,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:33:46,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:33:46,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:33:46,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:33:46,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:33:46,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:33:46" (1/1) ... [2024-10-13 10:33:46,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34464825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:33:46, skipping insertion in model container [2024-10-13 10:33:46,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:33:46" (1/1) ... [2024-10-13 10:33:46,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:33:47,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:33:47,207 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:33:47,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:33:47,286 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:33:47,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:33:47 WrapperNode [2024-10-13 10:33:47,286 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:33:47,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:33:47,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:33:47,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:33:47,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:33:47" (1/1) ... [2024-10-13 10:33:47,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:33:47" (1/1) ... [2024-10-13 10:33:47,321 INFO L138 Inliner]: procedures = 111, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2024-10-13 10:33:47,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:33:47,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:33:47,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:33:47,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:33:47,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:33:47" (1/1) ... [2024-10-13 10:33:47,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:33:47" (1/1) ... [2024-10-13 10:33:47,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:33:47" (1/1) ... [2024-10-13 10:33:47,350 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [7, 3, 4]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 7 writes are split as follows [3, 2, 2]. [2024-10-13 10:33:47,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:33:47" (1/1) ... [2024-10-13 10:33:47,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:33:47" (1/1) ... [2024-10-13 10:33:47,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:33:47" (1/1) ... [2024-10-13 10:33:47,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:33:47" (1/1) ... [2024-10-13 10:33:47,365 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:33:47" (1/1) ... [2024-10-13 10:33:47,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:33:47" (1/1) ... [2024-10-13 10:33:47,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:33:47,376 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:33:47,376 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:33:47,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:33:47,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:33:47" (1/1) ... [2024-10-13 10:33:47,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:33:47,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:33:47,407 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-10-13 10:33:47,409 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-10-13 10:33:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 10:33:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 10:33:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 10:33:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:33:47,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 10:33:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 10:33:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:33:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:33:47,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:33:47,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:33:47,536 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:33:47,538 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:33:47,755 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-10-13 10:33:47,755 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:33:47,811 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:33:47,817 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 10:33:47,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:33:47 BoogieIcfgContainer [2024-10-13 10:33:47,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:33:47,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:33:47,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:33:47,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:33:47,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:33:46" (1/3) ... [2024-10-13 10:33:47,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eabc71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:33:47, skipping insertion in model container [2024-10-13 10:33:47,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:33:47" (2/3) ... [2024-10-13 10:33:47,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eabc71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:33:47, skipping insertion in model container [2024-10-13 10:33:47,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:33:47" (3/3) ... [2024-10-13 10:33:47,832 INFO L112 eAbstractionObserver]: Analyzing ICFG aviad_true-alloca.i [2024-10-13 10:33:47,849 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:33:47,849 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-10-13 10:33:47,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:33:47,909 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;@5d1d75dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:33:47,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-10-13 10:33:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:33:47,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:33:47,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:33:47,921 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:33:47,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:33:47,925 INFO L85 PathProgramCache]: Analyzing trace with hash 3290, now seen corresponding path program 1 times [2024-10-13 10:33:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:33:47,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671167169] [2024-10-13 10:33:47,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:33:47,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:33:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:33:48,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:33:48,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:33:48,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671167169] [2024-10-13 10:33:48,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671167169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:33:48,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:33:48,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:33:48,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710588055] [2024-10-13 10:33:48,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:33:48,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:33:48,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:33:48,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:33:48,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:33:48,347 INFO L87 Difference]: Start difference. First operand has 48 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:48,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:33:48,437 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2024-10-13 10:33:48,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:33:48,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 10:33:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:33:48,447 INFO L225 Difference]: With dead ends: 41 [2024-10-13 10:33:48,448 INFO L226 Difference]: Without dead ends: 40 [2024-10-13 10:33:48,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:33:48,454 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:33:48,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 12 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:33:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-13 10:33:48,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-13 10:33:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:48,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2024-10-13 10:33:48,515 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 2 [2024-10-13 10:33:48,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:33:48,516 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2024-10-13 10:33:48,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2024-10-13 10:33:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:33:48,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:33:48,521 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:33:48,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:33:48,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:33:48,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:33:48,522 INFO L85 PathProgramCache]: Analyzing trace with hash 3291, now seen corresponding path program 1 times [2024-10-13 10:33:48,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:33:48,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786301030] [2024-10-13 10:33:48,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:33:48,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:33:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:33:48,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:33:48,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:33:48,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786301030] [2024-10-13 10:33:48,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786301030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:33:48,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:33:48,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:33:48,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27818050] [2024-10-13 10:33:48,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:33:48,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:33:48,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:33:48,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:33:48,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:33:48,728 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:33:48,783 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2024-10-13 10:33:48,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:33:48,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 10:33:48,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:33:48,784 INFO L225 Difference]: With dead ends: 33 [2024-10-13 10:33:48,784 INFO L226 Difference]: Without dead ends: 33 [2024-10-13 10:33:48,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:33:48,786 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:33:48,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 13 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:33:48,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-13 10:33:48,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-13 10:33:48,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-10-13 10:33:48,789 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 2 [2024-10-13 10:33:48,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:33:48,790 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-10-13 10:33:48,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-10-13 10:33:48,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 10:33:48,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:33:48,790 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 10:33:48,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:33:48,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:33:48,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:33:48,791 INFO L85 PathProgramCache]: Analyzing trace with hash 101966, now seen corresponding path program 1 times [2024-10-13 10:33:48,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:33:48,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307850949] [2024-10-13 10:33:48,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:33:48,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:33:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:33:48,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:33:48,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:33:48,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307850949] [2024-10-13 10:33:48,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307850949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:33:48,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:33:48,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:33:48,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110814703] [2024-10-13 10:33:48,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:33:48,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:33:48,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:33:48,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:33:48,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:33:48,834 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:48,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:33:48,873 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-10-13 10:33:48,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:33:48,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-13 10:33:48,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:33:48,875 INFO L225 Difference]: With dead ends: 30 [2024-10-13 10:33:48,875 INFO L226 Difference]: Without dead ends: 30 [2024-10-13 10:33:48,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:33:48,876 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:33:48,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 9 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:33:48,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-13 10:33:48,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-13 10:33:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:48,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-10-13 10:33:48,881 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 3 [2024-10-13 10:33:48,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:33:48,882 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-10-13 10:33:48,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:48,883 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-10-13 10:33:48,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 10:33:48,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:33:48,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 10:33:48,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:33:48,884 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:33:48,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:33:48,884 INFO L85 PathProgramCache]: Analyzing trace with hash 101967, now seen corresponding path program 1 times [2024-10-13 10:33:48,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:33:48,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683503434] [2024-10-13 10:33:48,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:33:48,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:33:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:33:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:33:48,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:33:48,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683503434] [2024-10-13 10:33:48,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683503434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:33:48,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:33:48,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:33:48,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364806105] [2024-10-13 10:33:48,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:33:48,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:33:48,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:33:48,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:33:48,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:33:48,993 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:49,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:33:49,032 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-10-13 10:33:49,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:33:49,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-13 10:33:49,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:33:49,033 INFO L225 Difference]: With dead ends: 27 [2024-10-13 10:33:49,033 INFO L226 Difference]: Without dead ends: 27 [2024-10-13 10:33:49,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:33:49,035 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:33:49,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 10 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:33:49,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-13 10:33:49,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-13 10:33:49,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 26 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-10-13 10:33:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-10-13 10:33:49,043 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 3 [2024-10-13 10:33:49,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:33:49,043 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-10-13 10:33:49,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-10-13 10:33:49,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 10:33:49,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:33:49,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 10:33:49,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:33:49,045 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:33:49,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:33:49,046 INFO L85 PathProgramCache]: Analyzing trace with hash 3160925, now seen corresponding path program 1 times [2024-10-13 10:33:49,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:33:49,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060728804] [2024-10-13 10:33:49,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:33:49,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:33:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:33:49,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:33:49,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:33:49,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060728804] [2024-10-13 10:33:49,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060728804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:33:49,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:33:49,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:33:49,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034409137] [2024-10-13 10:33:49,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:33:49,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:33:49,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:33:49,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:33:49,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:33:49,096 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:49,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:33:49,142 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2024-10-13 10:33:49,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:33:49,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-13 10:33:49,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:33:49,143 INFO L225 Difference]: With dead ends: 23 [2024-10-13 10:33:49,143 INFO L226 Difference]: Without dead ends: 23 [2024-10-13 10:33:49,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:33:49,144 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5 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-10-13 10:33:49,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:33:49,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-13 10:33:49,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-13 10:33:49,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-10-13 10:33:49,149 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 4 [2024-10-13 10:33:49,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:33:49,150 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-10-13 10:33:49,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:49,150 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-10-13 10:33:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 10:33:49,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:33:49,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 10:33:49,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:33:49,150 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:33:49,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:33:49,151 INFO L85 PathProgramCache]: Analyzing trace with hash 3160926, now seen corresponding path program 1 times [2024-10-13 10:33:49,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:33:49,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584199137] [2024-10-13 10:33:49,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:33:49,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:33:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:33:49,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:33:49,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:33:49,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584199137] [2024-10-13 10:33:49,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584199137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:33:49,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:33:49,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:33:49,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786469465] [2024-10-13 10:33:49,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:33:49,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:33:49,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:33:49,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:33:49,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:33:49,220 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:49,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:33:49,267 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2024-10-13 10:33:49,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:33:49,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-13 10:33:49,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:33:49,269 INFO L225 Difference]: With dead ends: 19 [2024-10-13 10:33:49,269 INFO L226 Difference]: Without dead ends: 19 [2024-10-13 10:33:49,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:33:49,271 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:33:49,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 6 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:33:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-13 10:33:49,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-13 10:33:49,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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-10-13 10:33:49,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-10-13 10:33:49,277 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 4 [2024-10-13 10:33:49,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:33:49,278 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-10-13 10:33:49,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:49,278 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2024-10-13 10:33:49,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:33:49,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:33:49,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:33:49,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:33:49,279 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:33:49,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:33:49,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1397568675, now seen corresponding path program 1 times [2024-10-13 10:33:49,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:33:49,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330397627] [2024-10-13 10:33:49,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:33:49,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:33:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:33:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:33:49,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:33:49,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330397627] [2024-10-13 10:33:49,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330397627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:33:49,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:33:49,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:33:49,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593858677] [2024-10-13 10:33:49,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:33:49,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:33:49,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:33:49,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:33:49,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:33:49,618 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:49,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:33:49,661 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-10-13 10:33:49,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:33:49,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2024-10-13 10:33:49,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:33:49,662 INFO L225 Difference]: With dead ends: 18 [2024-10-13 10:33:49,662 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 10:33:49,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:33:49,663 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:33:49,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:33:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 10:33:49,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 10:33:49,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:49,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 10:33:49,664 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2024-10-13 10:33:49,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:33:49,665 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 10:33:49,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 10:33:49,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 10:33:49,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 29 remaining) [2024-10-13 10:33:49,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 29 remaining) [2024-10-13 10:33:49,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 29 remaining) [2024-10-13 10:33:49,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 29 remaining) [2024-10-13 10:33:49,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 29 remaining) [2024-10-13 10:33:49,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 29 remaining) [2024-10-13 10:33:49,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 29 remaining) [2024-10-13 10:33:49,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 29 remaining) [2024-10-13 10:33:49,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 29 remaining) [2024-10-13 10:33:49,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 29 remaining) [2024-10-13 10:33:49,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 29 remaining) [2024-10-13 10:33:49,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 29 remaining) [2024-10-13 10:33:49,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 29 remaining) [2024-10-13 10:33:49,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 29 remaining) [2024-10-13 10:33:49,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 29 remaining) [2024-10-13 10:33:49,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 29 remaining) [2024-10-13 10:33:49,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 29 remaining) [2024-10-13 10:33:49,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 29 remaining) [2024-10-13 10:33:49,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 29 remaining) [2024-10-13 10:33:49,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 29 remaining) [2024-10-13 10:33:49,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 29 remaining) [2024-10-13 10:33:49,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 29 remaining) [2024-10-13 10:33:49,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 29 remaining) [2024-10-13 10:33:49,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 29 remaining) [2024-10-13 10:33:49,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 29 remaining) [2024-10-13 10:33:49,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 29 remaining) [2024-10-13 10:33:49,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 29 remaining) [2024-10-13 10:33:49,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 29 remaining) [2024-10-13 10:33:49,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK (0 of 29 remaining) [2024-10-13 10:33:49,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:33:49,682 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:33:49,684 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:33:49,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:33:49 BoogieIcfgContainer [2024-10-13 10:33:49,687 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:33:49,688 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:33:49,688 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:33:49,688 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:33:49,688 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:33:47" (3/4) ... [2024-10-13 10:33:49,692 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 10:33:49,701 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-13 10:33:49,701 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 10:33:49,701 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-13 10:33:49,701 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-13 10:33:49,793 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 10:33:49,793 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 10:33:49,793 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:33:49,794 INFO L158 Benchmark]: Toolchain (without parser) took 2971.40ms. Allocated memory was 163.6MB in the beginning and 201.3MB in the end (delta: 37.7MB). Free memory was 112.7MB in the beginning and 111.7MB in the end (delta: 982.3kB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2024-10-13 10:33:49,794 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 55.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:33:49,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.27ms. Allocated memory is still 163.6MB. Free memory was 112.2MB in the beginning and 128.3MB in the end (delta: -16.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 10:33:49,795 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.17ms. Allocated memory is still 163.6MB. Free memory was 128.3MB in the beginning and 126.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:33:49,795 INFO L158 Benchmark]: Boogie Preprocessor took 51.54ms. Allocated memory is still 163.6MB. Free memory was 126.4MB in the beginning and 124.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:33:49,795 INFO L158 Benchmark]: RCFGBuilder took 441.22ms. Allocated memory is still 163.6MB. Free memory was 124.3MB in the beginning and 104.7MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 10:33:49,795 INFO L158 Benchmark]: TraceAbstraction took 1868.24ms. Allocated memory was 163.6MB in the beginning and 201.3MB in the end (delta: 37.7MB). Free memory was 104.0MB in the beginning and 116.9MB in the end (delta: -12.9MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2024-10-13 10:33:49,795 INFO L158 Benchmark]: Witness Printer took 105.89ms. Allocated memory is still 201.3MB. Free memory was 116.9MB in the beginning and 111.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 10:33:49,796 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 96.5MB. Free memory is still 55.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.27ms. Allocated memory is still 163.6MB. Free memory was 112.2MB in the beginning and 128.3MB in the end (delta: -16.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.17ms. Allocated memory is still 163.6MB. Free memory was 128.3MB in the beginning and 126.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.54ms. Allocated memory is still 163.6MB. Free memory was 126.4MB in the beginning and 124.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 441.22ms. Allocated memory is still 163.6MB. Free memory was 124.3MB in the beginning and 104.7MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1868.24ms. Allocated memory was 163.6MB in the beginning and 201.3MB in the end (delta: 37.7MB). Free memory was 104.0MB in the beginning and 116.9MB in the end (delta: -12.9MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * Witness Printer took 105.89ms. Allocated memory is still 201.3MB. Free memory was 116.9MB in the beginning and 111.7MB 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: -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: 562]: 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, 48 locations, 29 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 182 IncrementalHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 56 mSDtfsCounter, 182 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred 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.9s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 273 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 29 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 10:33:49,832 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