./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_-write.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6ae2ee47 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 ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_-write.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 db4b4fb03b1dcc2b831885b6cb4b7f01d511832c58de7e20715e49b64db06c6b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 16:29:33,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 16:29:33,715 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-22 16:29:33,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 16:29:33,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 16:29:33,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 16:29:33,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 16:29:33,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 16:29:33,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 16:29:33,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 16:29:33,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 16:29:33,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 16:29:33,750 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 16:29:33,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 16:29:33,751 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 16:29:33,751 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 16:29:33,752 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 16:29:33,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 16:29:33,752 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-22 16:29:33,752 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-22 16:29:33,753 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-22 16:29:33,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 16:29:33,753 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 16:29:33,754 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-22 16:29:33,754 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 16:29:33,754 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 16:29:33,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 16:29:33,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 16:29:33,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 16:29:33,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 16:29:33,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 16:29:33,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 16:29:33,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 16:29:33,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 16:29:33,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 16:29:33,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 16:29:33,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 16:29:33,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 16:29:33,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 16:29:33,758 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 -> db4b4fb03b1dcc2b831885b6cb4b7f01d511832c58de7e20715e49b64db06c6b [2023-11-22 16:29:33,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 16:29:33,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 16:29:33,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 16:29:33,987 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 16:29:33,987 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 16:29:33,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_-write.c [2023-11-22 16:29:35,040 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 16:29:35,205 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 16:29:35,206 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_-write.c [2023-11-22 16:29:35,212 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4595144b3/3042b1e461ea42909e9bb2d00809b334/FLAG7a4a0fb9c [2023-11-22 16:29:35,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4595144b3/3042b1e461ea42909e9bb2d00809b334 [2023-11-22 16:29:35,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 16:29:35,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 16:29:35,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 16:29:35,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 16:29:35,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 16:29:35,234 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:29:35" (1/1) ... [2023-11-22 16:29:35,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cee5df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:35, skipping insertion in model container [2023-11-22 16:29:35,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:29:35" (1/1) ... [2023-11-22 16:29:35,253 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 16:29:35,386 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 16:29:35,394 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 16:29:35,410 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 16:29:35,421 INFO L206 MainTranslator]: Completed translation [2023-11-22 16:29:35,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:35 WrapperNode [2023-11-22 16:29:35,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 16:29:35,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 16:29:35,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 16:29:35,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 16:29:35,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:35" (1/1) ... [2023-11-22 16:29:35,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:35" (1/1) ... [2023-11-22 16:29:35,449 INFO L138 Inliner]: procedures = 9, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 86 [2023-11-22 16:29:35,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 16:29:35,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 16:29:35,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 16:29:35,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 16:29:35,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:35" (1/1) ... [2023-11-22 16:29:35,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:35" (1/1) ... [2023-11-22 16:29:35,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:35" (1/1) ... [2023-11-22 16:29:35,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:35" (1/1) ... [2023-11-22 16:29:35,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:35" (1/1) ... [2023-11-22 16:29:35,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:35" (1/1) ... [2023-11-22 16:29:35,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:35" (1/1) ... [2023-11-22 16:29:35,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:35" (1/1) ... [2023-11-22 16:29:35,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 16:29:35,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 16:29:35,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 16:29:35,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 16:29:35,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:35" (1/1) ... [2023-11-22 16:29:35,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 16:29:35,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 16:29:35,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 16:29:35,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 16:29:35,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-22 16:29:35,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 16:29:35,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 16:29:35,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-22 16:29:35,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 16:29:35,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 16:29:35,623 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 16:29:35,624 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 16:29:35,798 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 16:29:35,829 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 16:29:35,829 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-22 16:29:35,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:29:35 BoogieIcfgContainer [2023-11-22 16:29:35,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 16:29:35,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 16:29:35,831 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 16:29:35,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 16:29:35,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 04:29:35" (1/3) ... [2023-11-22 16:29:35,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507223ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:29:35, skipping insertion in model container [2023-11-22 16:29:35,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:29:35" (2/3) ... [2023-11-22 16:29:35,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507223ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:29:35, skipping insertion in model container [2023-11-22 16:29:35,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:29:35" (3/3) ... [2023-11-22 16:29:35,836 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_-write.c [2023-11-22 16:29:35,849 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 16:29:35,850 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-22 16:29:35,892 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 16:29:35,916 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@663af0db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 16:29:35,917 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-11-22 16:29:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 29 states have internal predecessors, (39), 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) [2023-11-22 16:29:35,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-22 16:29:35,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:35,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-22 16:29:35,953 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-11-22 16:29:35,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:35,959 INFO L85 PathProgramCache]: Analyzing trace with hash 3853227, now seen corresponding path program 1 times [2023-11-22 16:29:35,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:35,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839311938] [2023-11-22 16:29:35,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:35,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:36,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:29:36,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:36,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839311938] [2023-11-22 16:29:36,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839311938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:36,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:36,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 16:29:36,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668383779] [2023-11-22 16:29:36,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:36,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 16:29:36,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:36,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 16:29:36,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 16:29:36,325 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 29 states have internal predecessors, (39), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:29:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:36,414 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2023-11-22 16:29:36,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 16:29:36,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-22 16:29:36,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:36,422 INFO L225 Difference]: With dead ends: 28 [2023-11-22 16:29:36,422 INFO L226 Difference]: Without dead ends: 27 [2023-11-22 16:29:36,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 16:29:36,426 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:36,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 23 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 16:29:36,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-22 16:29:36,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-22 16:29:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 26 states have internal predecessors, (32), 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) [2023-11-22 16:29:36,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2023-11-22 16:29:36,449 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 4 [2023-11-22 16:29:36,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:36,449 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2023-11-22 16:29:36,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:29:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2023-11-22 16:29:36,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-22 16:29:36,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:36,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-22 16:29:36,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 16:29:36,451 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-11-22 16:29:36,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:36,451 INFO L85 PathProgramCache]: Analyzing trace with hash 3853228, now seen corresponding path program 1 times [2023-11-22 16:29:36,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:36,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955465596] [2023-11-22 16:29:36,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:36,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:29:36,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:36,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955465596] [2023-11-22 16:29:36,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955465596] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:36,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:36,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 16:29:36,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173895072] [2023-11-22 16:29:36,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:36,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 16:29:36,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:36,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 16:29:36,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 16:29:36,579 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:29:36,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:36,688 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2023-11-22 16:29:36,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 16:29:36,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-22 16:29:36,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:36,692 INFO L225 Difference]: With dead ends: 60 [2023-11-22 16:29:36,692 INFO L226 Difference]: Without dead ends: 60 [2023-11-22 16:29:36,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 16:29:36,697 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 47 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:36,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 33 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 16:29:36,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-22 16:29:36,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 30. [2023-11-22 16:29:36,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 29 states have internal predecessors, (37), 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) [2023-11-22 16:29:36,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-11-22 16:29:36,708 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 4 [2023-11-22 16:29:36,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:36,708 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-11-22 16:29:36,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:29:36,709 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-11-22 16:29:36,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-22 16:29:36,709 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:36,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-22 16:29:36,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 16:29:36,710 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-11-22 16:29:36,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:36,710 INFO L85 PathProgramCache]: Analyzing trace with hash 119440320, now seen corresponding path program 1 times [2023-11-22 16:29:36,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:36,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914147874] [2023-11-22 16:29:36,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:36,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:36,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:29:36,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:36,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914147874] [2023-11-22 16:29:36,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914147874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:36,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:36,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 16:29:36,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584358] [2023-11-22 16:29:36,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:36,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 16:29:36,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:36,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 16:29:36,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 16:29:36,728 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:29:36,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:36,750 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2023-11-22 16:29:36,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 16:29:36,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-22 16:29:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:36,751 INFO L225 Difference]: With dead ends: 46 [2023-11-22 16:29:36,751 INFO L226 Difference]: Without dead ends: 46 [2023-11-22 16:29:36,752 INFO L412 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 [2023-11-22 16:29:36,752 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:36,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 33 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 16:29:36,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-22 16:29:36,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 29. [2023-11-22 16:29:36,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.7) internal successors, (34), 28 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) [2023-11-22 16:29:36,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-11-22 16:29:36,756 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 5 [2023-11-22 16:29:36,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:36,756 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-11-22 16:29:36,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:29:36,756 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-11-22 16:29:36,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-22 16:29:36,757 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:36,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-22 16:29:36,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 16:29:36,757 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-11-22 16:29:36,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:36,758 INFO L85 PathProgramCache]: Analyzing trace with hash 119450029, now seen corresponding path program 1 times [2023-11-22 16:29:36,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:36,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16224979] [2023-11-22 16:29:36,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:36,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 16:29:36,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 16:29:36,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 16:29:36,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16224979] [2023-11-22 16:29:36,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16224979] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 16:29:36,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 16:29:36,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 16:29:36,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479364918] [2023-11-22 16:29:36,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 16:29:36,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 16:29:36,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 16:29:36,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 16:29:36,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 16:29:36,811 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:29:36,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 16:29:36,828 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2023-11-22 16:29:36,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 16:29:36,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-22 16:29:36,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 16:29:36,829 INFO L225 Difference]: With dead ends: 28 [2023-11-22 16:29:36,829 INFO L226 Difference]: Without dead ends: 28 [2023-11-22 16:29:36,830 INFO L412 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 [2023-11-22 16:29:36,830 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 16:29:36,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 23 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 16:29:36,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-22 16:29:36,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-22 16:29:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.65) internal successors, (33), 27 states have internal predecessors, (33), 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) [2023-11-22 16:29:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2023-11-22 16:29:36,833 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 5 [2023-11-22 16:29:36,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 16:29:36,833 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2023-11-22 16:29:36,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 16:29:36,834 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2023-11-22 16:29:36,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-22 16:29:36,834 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 16:29:36,834 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-22 16:29:36,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 16:29:36,835 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-11-22 16:29:36,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 16:29:36,835 INFO L85 PathProgramCache]: Analyzing trace with hash 119450030, now seen corresponding path program 1 times [2023-11-22 16:29:36,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 16:29:36,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854015078] [2023-11-22 16:29:36,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 16:29:36,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 16:29:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 16:29:36,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-22 16:29:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 16:29:36,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-22 16:29:36,867 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-22 16:29:36,868 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 11 remaining) [2023-11-22 16:29:36,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2023-11-22 16:29:36,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2023-11-22 16:29:36,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 11 remaining) [2023-11-22 16:29:36,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 11 remaining) [2023-11-22 16:29:36,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2023-11-22 16:29:36,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2023-11-22 16:29:36,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 11 remaining) [2023-11-22 16:29:36,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2023-11-22 16:29:36,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 11 remaining) [2023-11-22 16:29:36,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (0 of 11 remaining) [2023-11-22 16:29:36,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 16:29:36,873 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-22 16:29:36,876 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 16:29:36,887 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem3 could not be translated [2023-11-22 16:29:36,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 04:29:36 BoogieIcfgContainer [2023-11-22 16:29:36,892 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 16:29:36,892 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 16:29:36,893 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 16:29:36,893 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 16:29:36,893 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:29:35" (3/4) ... [2023-11-22 16:29:36,894 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-22 16:29:36,896 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem3 could not be translated [2023-11-22 16:29:36,918 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-22 16:29:36,918 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 16:29:36,918 INFO L158 Benchmark]: Toolchain (without parser) took 1690.14ms. Allocated memory was 155.2MB in the beginning and 209.7MB in the end (delta: 54.5MB). Free memory was 101.1MB in the beginning and 106.1MB in the end (delta: -5.0MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2023-11-22 16:29:36,919 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 16:29:36,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.99ms. Allocated memory is still 155.2MB. Free memory was 101.1MB in the beginning and 90.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-22 16:29:36,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.97ms. Allocated memory is still 155.2MB. Free memory was 90.6MB in the beginning and 89.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 16:29:36,919 INFO L158 Benchmark]: Boogie Preprocessor took 28.52ms. Allocated memory is still 155.2MB. Free memory was 89.0MB in the beginning and 88.0MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 16:29:36,919 INFO L158 Benchmark]: RCFGBuilder took 351.12ms. Allocated memory is still 155.2MB. Free memory was 87.5MB in the beginning and 72.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-22 16:29:36,920 INFO L158 Benchmark]: TraceAbstraction took 1060.74ms. Allocated memory was 155.2MB in the beginning and 209.7MB in the end (delta: 54.5MB). Free memory was 71.8MB in the beginning and 108.2MB in the end (delta: -36.5MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2023-11-22 16:29:36,920 INFO L158 Benchmark]: Witness Printer took 25.51ms. Allocated memory is still 209.7MB. Free memory was 108.2MB in the beginning and 106.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 16:29:36,921 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.17ms. Allocated memory is still 155.2MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.99ms. Allocated memory is still 155.2MB. Free memory was 101.1MB in the beginning and 90.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.97ms. Allocated memory is still 155.2MB. Free memory was 90.6MB in the beginning and 89.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.52ms. Allocated memory is still 155.2MB. Free memory was 89.0MB in the beginning and 88.0MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 351.12ms. Allocated memory is still 155.2MB. Free memory was 87.5MB in the beginning and 72.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1060.74ms. Allocated memory was 155.2MB in the beginning and 209.7MB in the end (delta: 54.5MB). Free memory was 71.8MB in the beginning and 108.2MB in the end (delta: -36.5MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Witness Printer took 25.51ms. Allocated memory is still 209.7MB. Free memory was 108.2MB in the beginning and 106.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem3 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem3 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L32] int i, b[100]; [L33] i = 0 VAL [b={3:0}, i=0] [L33] COND TRUE i < 100 [L34] CALL foo(i, b, i + 1) [L21] int a[n], i; [L22] i = 0 VAL [\old(n)=0, \old(size)=1, a={2:0}, b={3:0}, b={3:0}, i=0, n=0, size=1] [L22] COND TRUE i < size VAL [\old(n)=0, \old(size)=1, a={2:0}, b={3:0}, b={3:0}, i=0, n=0, size=1] [L23] EXPR b[i] VAL [\old(n)=0, \old(size)=1, a={2:0}, b={3:0}, b={3:0}, i=0, n=0, size=1] [L23] a[i] = b[i] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 31]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 112 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 139 IncrementalHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 63 mSDtfsCounter, 139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 15, 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, 4 MinimizatonAttempts, 47 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 75 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 RESULT: Ultimate proved your program to be incorrect! [2023-11-22 16:29:36,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)