./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/StructInitialization1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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/ldv-memsafety/StructInitialization1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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 32bit --witnessprinter.graph.data.programhash b5a281f9631a62a08c6928334ef6ea60eabb7bbadcb2bd7487e60124ebe01585 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:32:08,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:32:08,280 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:32:08,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:32:08,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:32:08,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:32:08,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:32:08,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:32:08,328 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:32:08,329 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:32:08,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:32:08,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:32:08,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:32:08,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:32:08,330 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:32:08,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:32:08,331 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:32:08,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:32:08,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:32:08,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:32:08,335 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:32:08,336 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:32:08,336 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:32:08,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:32:08,337 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:32:08,337 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:32:08,337 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:32:08,337 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:32:08,337 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:32:08,338 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:32:08,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:32:08,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:32:08,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:32:08,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:32:08,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:32:08,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:32:08,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:32:08,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:32:08,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:32:08,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:32:08,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:32:08,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:32:08,341 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5a281f9631a62a08c6928334ef6ea60eabb7bbadcb2bd7487e60124ebe01585 [2024-11-17 00:32:08,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:32:08,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:32:08,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:32:08,596 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:32:08,597 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:32:08,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/StructInitialization1.c [2024-11-17 00:32:09,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:32:10,125 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:32:10,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/StructInitialization1.c [2024-11-17 00:32:10,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e1bdc594/1124a8a56f3a4311896809967ddfd4cf/FLAG74936b832 [2024-11-17 00:32:10,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e1bdc594/1124a8a56f3a4311896809967ddfd4cf [2024-11-17 00:32:10,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:32:10,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:32:10,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:32:10,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:32:10,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:32:10,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:32:10" (1/1) ... [2024-11-17 00:32:10,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e1ab9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:32:10, skipping insertion in model container [2024-11-17 00:32:10,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:32:10" (1/1) ... [2024-11-17 00:32:10,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:32:10,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:32:10,759 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:32:10,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:32:10,808 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:32:10,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:32:10 WrapperNode [2024-11-17 00:32:10,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:32:10,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:32:10,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:32:10,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:32:10,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:32:10" (1/1) ... [2024-11-17 00:32:10,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:32:10" (1/1) ... [2024-11-17 00:32:10,852 INFO L138 Inliner]: procedures = 11, calls = 82, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 290 [2024-11-17 00:32:10,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:32:10,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:32:10,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:32:10,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:32:10,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:32:10" (1/1) ... [2024-11-17 00:32:10,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:32:10" (1/1) ... [2024-11-17 00:32:10,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:32:10" (1/1) ... [2024-11-17 00:32:10,897 INFO L175 MemorySlicer]: Split 76 memory accesses to 1 slices as follows [76]. 100 percent of accesses are in the largest equivalence class. The 36 initializations are split as follows [36]. The 0 writes are split as follows [0]. [2024-11-17 00:32:10,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:32:10" (1/1) ... [2024-11-17 00:32:10,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:32:10" (1/1) ... [2024-11-17 00:32:10,954 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:32:10" (1/1) ... [2024-11-17 00:32:10,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:32:10" (1/1) ... [2024-11-17 00:32:10,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:32:10" (1/1) ... [2024-11-17 00:32:10,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:32:10" (1/1) ... [2024-11-17 00:32:10,967 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:32:10,969 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:32:10,969 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:32:10,969 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:32:10,970 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:32:10" (1/1) ... [2024-11-17 00:32:10,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:32:10,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:32:10,998 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-17 00:32:11,000 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-17 00:32:11,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:32:11,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-17 00:32:11,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:32:11,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:32:11,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:32:11,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:32:11,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:32:11,140 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:32:11,144 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:32:11,577 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-17 00:32:11,578 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:32:11,595 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:32:11,596 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:32:11,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:32:11 BoogieIcfgContainer [2024-11-17 00:32:11,599 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:32:11,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:32:11,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:32:11,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:32:11,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:32:10" (1/3) ... [2024-11-17 00:32:11,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e86cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:32:11, skipping insertion in model container [2024-11-17 00:32:11,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:32:10" (2/3) ... [2024-11-17 00:32:11,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e86cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:32:11, skipping insertion in model container [2024-11-17 00:32:11,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:32:11" (3/3) ... [2024-11-17 00:32:11,610 INFO L112 eAbstractionObserver]: Analyzing ICFG StructInitialization1.c [2024-11-17 00:32:11,622 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:32:11,623 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 81 error locations. [2024-11-17 00:32:11,656 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:32:11,661 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;@21aa7691, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:32:11,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 81 error locations. [2024-11-17 00:32:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 157 states, 75 states have (on average 2.08) internal successors, (156), 156 states have internal predecessors, (156), 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-17 00:32:11,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 00:32:11,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:32:11,670 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 00:32:11,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-17 00:32:11,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:32:11,674 INFO L85 PathProgramCache]: Analyzing trace with hash 183672, now seen corresponding path program 1 times [2024-11-17 00:32:11,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:32:11,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230689285] [2024-11-17 00:32:11,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:32:11,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:32:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:32:12,089 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-17 00:32:12,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:32:12,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230689285] [2024-11-17 00:32:12,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230689285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:32:12,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:32:12,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 00:32:12,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863387510] [2024-11-17 00:32:12,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:32:12,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:32:12,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:32:12,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:32:12,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:32:12,152 INFO L87 Difference]: Start difference. First operand has 157 states, 75 states have (on average 2.08) internal successors, (156), 156 states have internal predecessors, (156), 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), 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-11-17 00:32:12,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:32:12,328 INFO L93 Difference]: Finished difference Result 117 states and 116 transitions. [2024-11-17 00:32:12,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:32:12,333 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-11-17 00:32:12,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:32:12,340 INFO L225 Difference]: With dead ends: 117 [2024-11-17 00:32:12,341 INFO L226 Difference]: Without dead ends: 114 [2024-11-17 00:32:12,342 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-11-17 00:32:12,345 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 114 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:32:12,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 32 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:32:12,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-17 00:32:12,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-17 00:32:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 73 states have (on average 1.547945205479452) internal successors, (113), 113 states have internal predecessors, (113), 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-17 00:32:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 113 transitions. [2024-11-17 00:32:12,376 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 113 transitions. Word has length 3 [2024-11-17 00:32:12,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:32:12,376 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 113 transitions. [2024-11-17 00:32:12,376 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-11-17 00:32:12,377 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 113 transitions. [2024-11-17 00:32:12,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 00:32:12,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:32:12,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 00:32:12,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:32:12,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-17 00:32:12,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:32:12,378 INFO L85 PathProgramCache]: Analyzing trace with hash 183673, now seen corresponding path program 1 times [2024-11-17 00:32:12,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:32:12,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996309472] [2024-11-17 00:32:12,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:32:12,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:32:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:32:12,530 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-17 00:32:12,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:32:12,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996309472] [2024-11-17 00:32:12,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996309472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:32:12,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:32:12,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 00:32:12,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697420245] [2024-11-17 00:32:12,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:32:12,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:32:12,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:32:12,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:32:12,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:32:12,533 INFO L87 Difference]: Start difference. First operand 114 states and 113 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-11-17 00:32:12,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:32:12,623 INFO L93 Difference]: Finished difference Result 74 states and 73 transitions. [2024-11-17 00:32:12,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:32:12,623 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-11-17 00:32:12,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:32:12,624 INFO L225 Difference]: With dead ends: 74 [2024-11-17 00:32:12,624 INFO L226 Difference]: Without dead ends: 74 [2024-11-17 00:32:12,625 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-11-17 00:32:12,626 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:32:12,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 33 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:32:12,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-17 00:32:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-17 00:32:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.0) internal successors, (73), 73 states have internal predecessors, (73), 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-17 00:32:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 73 transitions. [2024-11-17 00:32:12,631 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 73 transitions. Word has length 3 [2024-11-17 00:32:12,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:32:12,631 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 73 transitions. [2024-11-17 00:32:12,632 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-11-17 00:32:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 73 transitions. [2024-11-17 00:32:12,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-17 00:32:12,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:32:12,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:32:12,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:32:12,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-17 00:32:12,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:32:12,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2109854394, now seen corresponding path program 1 times [2024-11-17 00:32:12,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:32:12,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137668232] [2024-11-17 00:32:12,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:32:12,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:32:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:32:12,778 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-17 00:32:12,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:32:12,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137668232] [2024-11-17 00:32:12,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137668232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:32:12,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:32:12,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:32:12,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488972382] [2024-11-17 00:32:12,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:32:12,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:32:12,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:32:12,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:32:12,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:32:12,781 INFO L87 Difference]: Start difference. First operand 74 states and 73 transitions. Second operand has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 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-17 00:32:12,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:32:12,829 INFO L93 Difference]: Finished difference Result 73 states and 72 transitions. [2024-11-17 00:32:12,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:32:12,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 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 73 [2024-11-17 00:32:12,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:32:12,830 INFO L225 Difference]: With dead ends: 73 [2024-11-17 00:32:12,831 INFO L226 Difference]: Without dead ends: 0 [2024-11-17 00:32:12,831 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-17 00:32:12,832 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:32:12,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:32:12,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-17 00:32:12,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-17 00:32:12,833 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-17 00:32:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-17 00:32:12,833 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2024-11-17 00:32:12,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:32:12,833 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 00:32:12,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 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-17 00:32:12,834 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-17 00:32:12,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-17 00:32:12,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (80 of 81 remaining) [2024-11-17 00:32:12,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 81 remaining) [2024-11-17 00:32:12,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 81 remaining) [2024-11-17 00:32:12,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 81 remaining) [2024-11-17 00:32:12,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 81 remaining) [2024-11-17 00:32:12,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 81 remaining) [2024-11-17 00:32:12,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 81 remaining) [2024-11-17 00:32:12,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 81 remaining) [2024-11-17 00:32:12,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 81 remaining) [2024-11-17 00:32:12,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 81 remaining) [2024-11-17 00:32:12,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 81 remaining) [2024-11-17 00:32:12,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 81 remaining) [2024-11-17 00:32:12,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 81 remaining) [2024-11-17 00:32:12,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 81 remaining) [2024-11-17 00:32:12,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 81 remaining) [2024-11-17 00:32:12,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 81 remaining) [2024-11-17 00:32:12,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 81 remaining) [2024-11-17 00:32:12,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 81 remaining) [2024-11-17 00:32:12,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 81 remaining) [2024-11-17 00:32:12,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 81 remaining) [2024-11-17 00:32:12,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 81 remaining) [2024-11-17 00:32:12,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 81 remaining) [2024-11-17 00:32:12,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 81 remaining) [2024-11-17 00:32:12,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 81 remaining) [2024-11-17 00:32:12,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 81 remaining) [2024-11-17 00:32:12,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 81 remaining) [2024-11-17 00:32:12,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 81 remaining) [2024-11-17 00:32:12,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 81 remaining) [2024-11-17 00:32:12,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 81 remaining) [2024-11-17 00:32:12,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 81 remaining) [2024-11-17 00:32:12,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 81 remaining) [2024-11-17 00:32:12,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 81 remaining) [2024-11-17 00:32:12,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 81 remaining) [2024-11-17 00:32:12,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 81 remaining) [2024-11-17 00:32:12,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 81 remaining) [2024-11-17 00:32:12,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 81 remaining) [2024-11-17 00:32:12,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 81 remaining) [2024-11-17 00:32:12,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 81 remaining) [2024-11-17 00:32:12,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 81 remaining) [2024-11-17 00:32:12,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 81 remaining) [2024-11-17 00:32:12,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 81 remaining) [2024-11-17 00:32:12,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 81 remaining) [2024-11-17 00:32:12,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 81 remaining) [2024-11-17 00:32:12,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 81 remaining) [2024-11-17 00:32:12,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 81 remaining) [2024-11-17 00:32:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 81 remaining) [2024-11-17 00:32:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 81 remaining) [2024-11-17 00:32:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 81 remaining) [2024-11-17 00:32:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 81 remaining) [2024-11-17 00:32:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 81 remaining) [2024-11-17 00:32:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 81 remaining) [2024-11-17 00:32:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 81 remaining) [2024-11-17 00:32:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 81 remaining) [2024-11-17 00:32:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 81 remaining) [2024-11-17 00:32:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 81 remaining) [2024-11-17 00:32:12,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 81 remaining) [2024-11-17 00:32:12,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 81 remaining) [2024-11-17 00:32:12,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 81 remaining) [2024-11-17 00:32:12,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 81 remaining) [2024-11-17 00:32:12,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 81 remaining) [2024-11-17 00:32:12,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 81 remaining) [2024-11-17 00:32:12,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 81 remaining) [2024-11-17 00:32:12,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 81 remaining) [2024-11-17 00:32:12,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 81 remaining) [2024-11-17 00:32:12,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 81 remaining) [2024-11-17 00:32:12,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 81 remaining) [2024-11-17 00:32:12,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 81 remaining) [2024-11-17 00:32:12,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 81 remaining) [2024-11-17 00:32:12,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 81 remaining) [2024-11-17 00:32:12,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 81 remaining) [2024-11-17 00:32:12,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 81 remaining) [2024-11-17 00:32:12,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 81 remaining) [2024-11-17 00:32:12,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 81 remaining) [2024-11-17 00:32:12,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 81 remaining) [2024-11-17 00:32:12,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 81 remaining) [2024-11-17 00:32:12,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 81 remaining) [2024-11-17 00:32:12,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 81 remaining) [2024-11-17 00:32:12,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 81 remaining) [2024-11-17 00:32:12,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 81 remaining) [2024-11-17 00:32:12,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 81 remaining) [2024-11-17 00:32:12,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 81 remaining) [2024-11-17 00:32:12,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:32:12,851 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-17 00:32:12,853 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 00:32:12,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:32:12 BoogieIcfgContainer [2024-11-17 00:32:12,856 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 00:32:12,857 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 00:32:12,857 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 00:32:12,857 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 00:32:12,858 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:32:11" (3/4) ... [2024-11-17 00:32:12,860 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-17 00:32:12,869 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-17 00:32:12,870 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-17 00:32:12,870 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-17 00:32:12,871 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-17 00:32:12,974 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 00:32:12,974 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-17 00:32:12,974 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 00:32:12,975 INFO L158 Benchmark]: Toolchain (without parser) took 2433.68ms. Allocated memory was 176.2MB in the beginning and 274.7MB in the end (delta: 98.6MB). Free memory was 103.6MB in the beginning and 240.4MB in the end (delta: -136.8MB). Peak memory consumption was 114.4MB. Max. memory is 16.1GB. [2024-11-17 00:32:12,975 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:32:12,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.83ms. Allocated memory is still 176.2MB. Free memory was 103.6MB in the beginning and 88.4MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 00:32:12,976 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.89ms. Allocated memory is still 176.2MB. Free memory was 88.4MB in the beginning and 85.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:32:12,976 INFO L158 Benchmark]: Boogie Preprocessor took 115.38ms. Allocated memory is still 176.2MB. Free memory was 85.5MB in the beginning and 144.2MB in the end (delta: -58.7MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-11-17 00:32:12,976 INFO L158 Benchmark]: IcfgBuilder took 630.73ms. Allocated memory is still 176.2MB. Free memory was 144.2MB in the beginning and 103.3MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-17 00:32:12,976 INFO L158 Benchmark]: TraceAbstraction took 1255.67ms. Allocated memory was 176.2MB in the beginning and 274.7MB in the end (delta: 98.6MB). Free memory was 102.3MB in the beginning and 100.0MB in the end (delta: 2.3MB). Peak memory consumption was 99.8MB. Max. memory is 16.1GB. [2024-11-17 00:32:12,977 INFO L158 Benchmark]: Witness Printer took 117.69ms. Allocated memory is still 274.7MB. Free memory was 100.0MB in the beginning and 240.4MB in the end (delta: -140.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 00:32:12,979 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.20ms. Allocated memory is still 176.2MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.83ms. Allocated memory is still 176.2MB. Free memory was 103.6MB in the beginning and 88.4MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.89ms. Allocated memory is still 176.2MB. Free memory was 88.4MB in the beginning and 85.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 115.38ms. Allocated memory is still 176.2MB. Free memory was 85.5MB in the beginning and 144.2MB in the end (delta: -58.7MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * IcfgBuilder took 630.73ms. Allocated memory is still 176.2MB. Free memory was 144.2MB in the beginning and 103.3MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1255.67ms. Allocated memory was 176.2MB in the beginning and 274.7MB in the end (delta: 98.6MB). Free memory was 102.3MB in the beginning and 100.0MB in the end (delta: 2.3MB). Peak memory consumption was 99.8MB. Max. memory is 16.1GB. * Witness Printer took 117.69ms. Allocated memory is still 274.7MB. Free memory was 100.0MB in the beginning and 240.4MB in the end (delta: -140.5MB). Peak memory consumption was 12.6MB. 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: 128]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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: -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: -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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 157 locations, 81 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 97 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 165 IncrementalHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 97 mSDtfsCounter, 165 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=0, InterpolantAutomatonStates: 9, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 254 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 81 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-17 00:32:13,018 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