/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/array-tiling/rewrev.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:28:36,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:28:36,111 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:28:36,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:28:36,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:28:36,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:28:36,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:28:36,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:28:36,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:28:36,188 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:28:36,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:28:36,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:28:36,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:28:36,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:28:36,202 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:28:36,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:28:36,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:28:36,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:28:36,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:28:36,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:28:36,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:28:36,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:28:36,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:28:36,238 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:28:36,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:28:36,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:28:36,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:28:36,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:28:36,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:28:36,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:28:36,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:28:36,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:28:36,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:28:36,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:28:36,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:28:36,258 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:28:36,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:28:36,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:28:36,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:28:36,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:28:36,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:28:36,263 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 16:28:36,316 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:28:36,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:28:36,317 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:28:36,317 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:28:36,319 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:28:36,319 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:28:36,322 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:28:36,323 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:28:36,323 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:28:36,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:28:36,324 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:28:36,325 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:28:36,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:28:36,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:28:36,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:28:36,325 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:28:36,326 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:28:36,326 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:28:36,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:28:36,326 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:28:36,326 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:28:36,327 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:28:36,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:28:36,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:28:36,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:28:36,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:28:36,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:28:36,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:28:36,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:28:36,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:28:36,328 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-10-15 16:28:36,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:28:36,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:28:36,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:28:36,832 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:28:36,833 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:28:36,835 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/rewrev.c [2022-10-15 16:28:36,910 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a83996fe6/502e5e9d2bf9403fab9cd11f13a9d70d/FLAGc1e5b454b [2022-10-15 16:28:37,597 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:28:37,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/rewrev.c [2022-10-15 16:28:37,608 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a83996fe6/502e5e9d2bf9403fab9cd11f13a9d70d/FLAGc1e5b454b [2022-10-15 16:28:37,938 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a83996fe6/502e5e9d2bf9403fab9cd11f13a9d70d [2022-10-15 16:28:37,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:28:37,947 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:28:37,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:28:37,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:28:37,955 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:28:37,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:28:37" (1/1) ... [2022-10-15 16:28:37,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b5a8b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:37, skipping insertion in model container [2022-10-15 16:28:37,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:28:37" (1/1) ... [2022-10-15 16:28:37,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:28:37,987 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:28:38,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/rewrev.c[397,410] [2022-10-15 16:28:38,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:28:38,282 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:28:38,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/rewrev.c[397,410] [2022-10-15 16:28:38,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:28:38,325 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:28:38,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:38 WrapperNode [2022-10-15 16:28:38,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:28:38,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:28:38,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:28:38,327 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:28:38,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:38" (1/1) ... [2022-10-15 16:28:38,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:38" (1/1) ... [2022-10-15 16:28:38,371 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2022-10-15 16:28:38,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:28:38,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:28:38,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:28:38,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:28:38,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:38" (1/1) ... [2022-10-15 16:28:38,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:38" (1/1) ... [2022-10-15 16:28:38,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:38" (1/1) ... [2022-10-15 16:28:38,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:38" (1/1) ... [2022-10-15 16:28:38,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:38" (1/1) ... [2022-10-15 16:28:38,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:38" (1/1) ... [2022-10-15 16:28:38,400 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:38" (1/1) ... [2022-10-15 16:28:38,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:38" (1/1) ... [2022-10-15 16:28:38,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:28:38,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:28:38,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:28:38,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:28:38,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:38" (1/1) ... [2022-10-15 16:28:38,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:28:38,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:38,452 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) [2022-10-15 16:28:38,478 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 [2022-10-15 16:28:38,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:28:38,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:28:38,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:28:38,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 16:28:38,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:28:38,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:28:38,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:28:38,604 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:28:38,607 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:28:38,789 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:28:38,797 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:28:38,797 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 16:28:38,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:28:38 BoogieIcfgContainer [2022-10-15 16:28:38,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:28:38,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:28:38,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:28:38,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:28:38,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:28:37" (1/3) ... [2022-10-15 16:28:38,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72bc0899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:28:38, skipping insertion in model container [2022-10-15 16:28:38,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:28:38" (2/3) ... [2022-10-15 16:28:38,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72bc0899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:28:38, skipping insertion in model container [2022-10-15 16:28:38,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:28:38" (3/3) ... [2022-10-15 16:28:38,811 INFO L112 eAbstractionObserver]: Analyzing ICFG rewrev.c [2022-10-15 16:28:38,871 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:28:38,872 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-10-15 16:28:38,991 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:28:39,009 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=FINITE_AUTOMATA, 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;@29471b23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:28:39,010 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-10-15 16:28:39,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 27 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) [2022-10-15 16:28:39,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:28:39,031 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:39,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:28:39,033 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:28:39,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:39,043 INFO L85 PathProgramCache]: Analyzing trace with hash 28748379, now seen corresponding path program 1 times [2022-10-15 16:28:39,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:39,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818787829] [2022-10-15 16:28:39,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:39,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:39,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:39,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818787829] [2022-10-15 16:28:39,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818787829] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:28:39,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:28:39,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:28:39,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84020419] [2022-10-15 16:28:39,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:28:39,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:28:39,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:39,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:28:39,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:28:39,280 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 27 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) 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) [2022-10-15 16:28:39,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:39,325 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-10-15 16:28:39,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:28:39,328 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 [2022-10-15 16:28:39,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:39,337 INFO L225 Difference]: With dead ends: 30 [2022-10-15 16:28:39,338 INFO L226 Difference]: Without dead ends: 26 [2022-10-15 16:28:39,340 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 [2022-10-15 16:28:39,345 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:39,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:28:39,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-10-15 16:28:39,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-10-15 16:28:39,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:39,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-10-15 16:28:39,391 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 5 [2022-10-15 16:28:39,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:39,392 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-10-15 16:28:39,392 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) [2022-10-15 16:28:39,393 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-10-15 16:28:39,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 16:28:39,393 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:39,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 16:28:39,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:28:39,394 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:28:39,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:39,395 INFO L85 PathProgramCache]: Analyzing trace with hash 889512685, now seen corresponding path program 1 times [2022-10-15 16:28:39,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:39,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024067847] [2022-10-15 16:28:39,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:39,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:39,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:39,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024067847] [2022-10-15 16:28:39,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024067847] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:28:39,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:28:39,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:28:39,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875562432] [2022-10-15 16:28:39,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:28:39,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:28:39,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:39,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:28:39,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:28:39,524 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-10-15 16:28:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:39,548 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-10-15 16:28:39,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:28:39,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-10-15 16:28:39,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:39,550 INFO L225 Difference]: With dead ends: 23 [2022-10-15 16:28:39,550 INFO L226 Difference]: Without dead ends: 23 [2022-10-15 16:28:39,550 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 [2022-10-15 16:28:39,552 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:39,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:28:39,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-10-15 16:28:39,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-10-15 16:28:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 22 states have internal predecessors, (25), 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) [2022-10-15 16:28:39,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-10-15 16:28:39,561 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 6 [2022-10-15 16:28:39,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:39,562 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-10-15 16:28:39,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-10-15 16:28:39,562 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-10-15 16:28:39,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 16:28:39,565 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:39,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 16:28:39,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:28:39,566 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:28:39,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:39,567 INFO L85 PathProgramCache]: Analyzing trace with hash 889512686, now seen corresponding path program 1 times [2022-10-15 16:28:39,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:39,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127878313] [2022-10-15 16:28:39,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:39,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:39,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:39,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:39,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127878313] [2022-10-15 16:28:39,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127878313] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:28:39,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:28:39,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:28:39,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844316541] [2022-10-15 16:28:39,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:28:39,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:28:39,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:39,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:28:39,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:28:39,849 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2022-10-15 16:28:39,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:39,902 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-10-15 16:28:39,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:28:39,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2022-10-15 16:28:39,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:39,904 INFO L225 Difference]: With dead ends: 26 [2022-10-15 16:28:39,904 INFO L226 Difference]: Without dead ends: 26 [2022-10-15 16:28:39,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:28:39,906 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:39,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 23 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:28:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-10-15 16:28:39,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-10-15 16:28:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-10-15 16:28:39,913 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 6 [2022-10-15 16:28:39,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:39,913 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-10-15 16:28:39,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2022-10-15 16:28:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-10-15 16:28:39,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 16:28:39,915 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:39,915 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:39,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:28:39,915 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:28:39,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:39,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2000640351, now seen corresponding path program 1 times [2022-10-15 16:28:39,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:39,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144201247] [2022-10-15 16:28:39,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:39,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:40,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:28:40,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:40,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144201247] [2022-10-15 16:28:40,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144201247] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:28:40,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:28:40,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:28:40,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566602892] [2022-10-15 16:28:40,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:28:40,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:28:40,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:40,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:28:40,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:28:40,259 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-10-15 16:28:40,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:40,354 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-10-15 16:28:40,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:28:40,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2022-10-15 16:28:40,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:40,356 INFO L225 Difference]: With dead ends: 25 [2022-10-15 16:28:40,356 INFO L226 Difference]: Without dead ends: 25 [2022-10-15 16:28:40,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:28:40,360 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:40,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 19 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:28:40,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-10-15 16:28:40,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-10-15 16:28:40,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 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) [2022-10-15 16:28:40,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-10-15 16:28:40,371 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 11 [2022-10-15 16:28:40,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:40,371 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-10-15 16:28:40,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-10-15 16:28:40,372 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-10-15 16:28:40,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:28:40,373 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:40,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:40,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:28:40,375 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:28:40,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:40,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1890358233, now seen corresponding path program 1 times [2022-10-15 16:28:40,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:40,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292043357] [2022-10-15 16:28:40,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:40,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:40,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:40,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292043357] [2022-10-15 16:28:40,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292043357] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:28:40,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:28:40,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:28:40,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805396907] [2022-10-15 16:28:40,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:28:40,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:28:40,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:40,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:28:40,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:28:40,521 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:40,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:40,553 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-10-15 16:28:40,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:28:40,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 16:28:40,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:40,555 INFO L225 Difference]: With dead ends: 26 [2022-10-15 16:28:40,555 INFO L226 Difference]: Without dead ends: 26 [2022-10-15 16:28:40,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:28:40,558 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:40,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 13 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:28:40,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-10-15 16:28:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-10-15 16:28:40,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-10-15 16:28:40,564 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 12 [2022-10-15 16:28:40,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:40,565 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-10-15 16:28:40,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:40,565 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-10-15 16:28:40,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 16:28:40,566 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:40,566 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:40,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:28:40,567 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:28:40,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:40,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1149999283, now seen corresponding path program 1 times [2022-10-15 16:28:40,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:40,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720555029] [2022-10-15 16:28:40,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:40,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 16:28:40,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:40,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720555029] [2022-10-15 16:28:40,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720555029] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:40,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490963053] [2022-10-15 16:28:40,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:40,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:40,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:40,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:28:40,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 16:28:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:40,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 16:28:40,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 16:28:40,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:41,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-10-15 16:28:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 16:28:41,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490963053] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:41,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:41,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-10-15 16:28:41,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123904915] [2022-10-15 16:28:41,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:41,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-15 16:28:41,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:41,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-15 16:28:41,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:28:41,157 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 13 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) [2022-10-15 16:28:41,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:41,362 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-10-15 16:28:41,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:28:41,363 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 13 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) Word has length 16 [2022-10-15 16:28:41,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:41,366 INFO L225 Difference]: With dead ends: 43 [2022-10-15 16:28:41,366 INFO L226 Difference]: Without dead ends: 43 [2022-10-15 16:28:41,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2022-10-15 16:28:41,375 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 184 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:41,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 30 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:28:41,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-10-15 16:28:41,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2022-10-15 16:28:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 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) [2022-10-15 16:28:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-10-15 16:28:41,390 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 16 [2022-10-15 16:28:41,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:41,391 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-10-15 16:28:41,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 13 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) [2022-10-15 16:28:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-10-15 16:28:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:28:41,394 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:41,395 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:41,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 16:28:41,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-10-15 16:28:41,610 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:28:41,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:41,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1290238167, now seen corresponding path program 1 times [2022-10-15 16:28:41,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:41,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290755834] [2022-10-15 16:28:41,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:41,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:28:41,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:41,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290755834] [2022-10-15 16:28:41,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290755834] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:28:41,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:28:41,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:28:41,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414922511] [2022-10-15 16:28:41,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:28:41,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:28:41,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:41,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:28:41,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:28:41,680 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-10-15 16:28:41,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:41,712 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-10-15 16:28:41,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:28:41,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 17 [2022-10-15 16:28:41,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:41,714 INFO L225 Difference]: With dead ends: 36 [2022-10-15 16:28:41,714 INFO L226 Difference]: Without dead ends: 36 [2022-10-15 16:28:41,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:28:41,715 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:41,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 26 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:28:41,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-15 16:28:41,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-10-15 16:28:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 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) [2022-10-15 16:28:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-10-15 16:28:41,721 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 17 [2022-10-15 16:28:41,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:41,721 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-10-15 16:28:41,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-10-15 16:28:41,722 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-10-15 16:28:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:28:41,722 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:41,723 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:41,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:28:41,723 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:28:41,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:41,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1325497124, now seen corresponding path program 1 times [2022-10-15 16:28:41,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:41,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782132902] [2022-10-15 16:28:41,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:41,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:42,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:42,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782132902] [2022-10-15 16:28:42,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782132902] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:42,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772408571] [2022-10-15 16:28:42,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:42,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:42,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:42,285 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:28:42,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 16:28:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:42,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjunts are in the unsatisfiable core [2022-10-15 16:28:42,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:42,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-10-15 16:28:42,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:28:42,705 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:28:42,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2022-10-15 16:28:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:28:42,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:42,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-10-15 16:28:42,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-10-15 16:28:42,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:28:42,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772408571] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:42,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:42,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2022-10-15 16:28:42,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016953625] [2022-10-15 16:28:42,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:42,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-10-15 16:28:42,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:42,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-10-15 16:28:42,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2022-10-15 16:28:42,967 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:43,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:43,524 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-10-15 16:28:43,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 16:28:43,525 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-15 16:28:43,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:43,526 INFO L225 Difference]: With dead ends: 41 [2022-10-15 16:28:43,526 INFO L226 Difference]: Without dead ends: 41 [2022-10-15 16:28:43,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=271, Invalid=851, Unknown=0, NotChecked=0, Total=1122 [2022-10-15 16:28:43,528 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 171 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:43,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 84 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 247 Invalid, 0 Unknown, 23 Unchecked, 0.2s Time] [2022-10-15 16:28:43,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-10-15 16:28:43,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-10-15 16:28:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 33 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) [2022-10-15 16:28:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-10-15 16:28:43,533 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 19 [2022-10-15 16:28:43,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:43,534 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-10-15 16:28:43,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:43,534 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-10-15 16:28:43,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 16:28:43,535 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:43,535 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:43,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 16:28:43,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-10-15 16:28:43,751 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:28:43,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:43,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1528887948, now seen corresponding path program 1 times [2022-10-15 16:28:43,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:43,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009226904] [2022-10-15 16:28:43,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:43,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:28:43,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:43,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009226904] [2022-10-15 16:28:43,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009226904] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:43,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923766424] [2022-10-15 16:28:43,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:43,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:43,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:43,828 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:28:43,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 16:28:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:43,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 16:28:43,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:43,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:28:43,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:28:44,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923766424] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:44,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:44,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-10-15 16:28:44,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87005743] [2022-10-15 16:28:44,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:44,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:28:44,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:44,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:28:44,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:28:44,008 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:44,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:44,090 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2022-10-15 16:28:44,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:28:44,090 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-15 16:28:44,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:44,091 INFO L225 Difference]: With dead ends: 45 [2022-10-15 16:28:44,091 INFO L226 Difference]: Without dead ends: 45 [2022-10-15 16:28:44,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2022-10-15 16:28:44,093 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 70 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:44,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 30 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:28:44,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-10-15 16:28:44,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-10-15 16:28:44,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 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) [2022-10-15 16:28:44,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-10-15 16:28:44,097 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 23 [2022-10-15 16:28:44,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:44,098 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-10-15 16:28:44,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:28:44,098 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-10-15 16:28:44,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 16:28:44,099 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:44,099 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:44,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 16:28:44,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:44,315 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:28:44,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:44,316 INFO L85 PathProgramCache]: Analyzing trace with hash 383675729, now seen corresponding path program 1 times [2022-10-15 16:28:44,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:44,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684765370] [2022-10-15 16:28:44,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:44,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:44,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:44,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:44,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684765370] [2022-10-15 16:28:44,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684765370] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:44,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493779129] [2022-10-15 16:28:44,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:44,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:44,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:44,895 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:28:44,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 16:28:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:44,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 18 conjunts are in the unsatisfiable core [2022-10-15 16:28:44,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:45,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-10-15 16:28:45,219 INFO L356 Elim1Store]: treesize reduction 30, result has 28.6 percent of original size [2022-10-15 16:28:45,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-10-15 16:28:45,519 INFO L356 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-10-15 16:28:45,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-10-15 16:28:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:45,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:45,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2022-10-15 16:28:45,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-10-15 16:28:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:46,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493779129] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:46,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:46,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2022-10-15 16:28:46,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887889313] [2022-10-15 16:28:46,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:46,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-15 16:28:46,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:46,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-15 16:28:46,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2022-10-15 16:28:46,018 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 31 states, 31 states have (on average 2.193548387096774) internal successors, (68), 31 states have internal predecessors, (68), 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) [2022-10-15 16:28:46,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:46,926 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-10-15 16:28:46,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-15 16:28:46,926 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.193548387096774) internal successors, (68), 31 states have internal predecessors, (68), 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 25 [2022-10-15 16:28:46,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:46,928 INFO L225 Difference]: With dead ends: 66 [2022-10-15 16:28:46,928 INFO L226 Difference]: Without dead ends: 66 [2022-10-15 16:28:46,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=303, Invalid=1419, Unknown=0, NotChecked=0, Total=1722 [2022-10-15 16:28:46,930 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 129 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:46,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 138 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 278 Invalid, 0 Unknown, 90 Unchecked, 0.2s Time] [2022-10-15 16:28:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-10-15 16:28:46,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2022-10-15 16:28:46,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 53 states have internal predecessors, (59), 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) [2022-10-15 16:28:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-10-15 16:28:46,936 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 25 [2022-10-15 16:28:46,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:46,937 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-10-15 16:28:46,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.193548387096774) internal successors, (68), 31 states have internal predecessors, (68), 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) [2022-10-15 16:28:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-10-15 16:28:46,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 16:28:46,938 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:46,939 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:46,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-10-15 16:28:47,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:47,153 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:28:47,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:47,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1180488649, now seen corresponding path program 1 times [2022-10-15 16:28:47,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:47,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514883293] [2022-10-15 16:28:47,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:47,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:47,263 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:47,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:28:47,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514883293] [2022-10-15 16:28:47,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514883293] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:28:47,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502534227] [2022-10-15 16:28:47,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:47,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:28:47,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:28:47,265 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:28:47,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-15 16:28:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:28:47,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 16:28:47,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:28:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:47,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:28:47,495 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:28:47,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502534227] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:28:47,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:28:47,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-10-15 16:28:47,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974801454] [2022-10-15 16:28:47,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:28:47,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-15 16:28:47,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:28:47,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-15 16:28:47,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:28:47,502 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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) [2022-10-15 16:28:47,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:28:47,638 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2022-10-15 16:28:47,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 16:28:47,638 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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 28 [2022-10-15 16:28:47,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:28:47,642 INFO L225 Difference]: With dead ends: 104 [2022-10-15 16:28:47,642 INFO L226 Difference]: Without dead ends: 104 [2022-10-15 16:28:47,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2022-10-15 16:28:47,644 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 77 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:28:47,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 70 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:28:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-10-15 16:28:47,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2022-10-15 16:28:47,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 93 states have (on average 1.1505376344086022) internal successors, (107), 95 states have internal predecessors, (107), 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) [2022-10-15 16:28:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2022-10-15 16:28:47,670 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 28 [2022-10-15 16:28:47,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:28:47,670 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2022-10-15 16:28:47,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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) [2022-10-15 16:28:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2022-10-15 16:28:47,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-15 16:28:47,675 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:28:47,676 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:47,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-15 16:28:47,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-10-15 16:28:47,877 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:28:47,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:28:47,878 INFO L85 PathProgramCache]: Analyzing trace with hash -2059558783, now seen corresponding path program 2 times [2022-10-15 16:28:47,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:28:47,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932797769] [2022-10-15 16:28:47,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:28:47,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:28:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:28:47,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:28:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:28:47,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:28:47,940 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:28:47,941 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2022-10-15 16:28:47,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 8 remaining) [2022-10-15 16:28:47,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2022-10-15 16:28:47,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 8 remaining) [2022-10-15 16:28:47,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 8 remaining) [2022-10-15 16:28:47,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 8 remaining) [2022-10-15 16:28:47,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 8 remaining) [2022-10-15 16:28:47,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2022-10-15 16:28:47,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 16:28:47,950 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:28:47,954 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:28:47,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:28:47 BoogieIcfgContainer [2022-10-15 16:28:47,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:28:47,997 INFO L158 Benchmark]: Toolchain (without parser) took 10054.43ms. Allocated memory was 160.4MB in the beginning and 231.7MB in the end (delta: 71.3MB). Free memory was 133.3MB in the beginning and 122.4MB in the end (delta: 10.9MB). Peak memory consumption was 82.4MB. Max. memory is 8.0GB. [2022-10-15 16:28:47,997 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 160.4MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:28:47,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.45ms. Allocated memory is still 160.4MB. Free memory was 133.1MB in the beginning and 123.0MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-10-15 16:28:47,998 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.66ms. Allocated memory is still 160.4MB. Free memory was 122.8MB in the beginning and 121.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 16:28:47,998 INFO L158 Benchmark]: Boogie Preprocessor took 31.53ms. Allocated memory is still 160.4MB. Free memory was 121.3MB in the beginning and 120.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 16:28:47,999 INFO L158 Benchmark]: RCFGBuilder took 395.34ms. Allocated memory is still 160.4MB. Free memory was 120.1MB in the beginning and 108.3MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-10-15 16:28:47,999 INFO L158 Benchmark]: TraceAbstraction took 9193.69ms. Allocated memory was 160.4MB in the beginning and 231.7MB in the end (delta: 71.3MB). Free memory was 107.7MB in the beginning and 122.4MB in the end (delta: -14.7MB). Peak memory consumption was 57.2MB. Max. memory is 8.0GB. [2022-10-15 16:28:48,001 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 160.4MB. Free memory is still 130.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 375.45ms. Allocated memory is still 160.4MB. Free memory was 133.1MB in the beginning and 123.0MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.66ms. Allocated memory is still 160.4MB. Free memory was 122.8MB in the beginning and 121.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.53ms. Allocated memory is still 160.4MB. Free memory was 121.3MB in the beginning and 120.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 395.34ms. Allocated memory is still 160.4MB. Free memory was 120.1MB in the beginning and 108.3MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 9193.69ms. Allocated memory was 160.4MB in the beginning and 231.7MB in the end (delta: 71.3MB). Free memory was 107.7MB in the beginning and 122.4MB in the end (delta: -14.7MB). Peak memory consumption was 57.2MB. Max. memory is 8.0GB. * 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 - UnprovableResult [Line: 15]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 15. Possible FailurePath: [L12] const int MAX = 100000; [L13] int SIZE; VAL [MAX=100000, SIZE=0] [L17] SIZE = __VERIFIER_nondet_int() [L18] COND TRUE SIZE > 1 && SIZE < MAX [L20] int i; [L21] int *a = malloc(sizeof(int)*SIZE); [L22] int val2 = 3; [L23] int val1 = 7; [L24] int low=2; [L26] i=SIZE-2 VAL [a={-1:0}, i=0, low=2, MAX=100000, SIZE=2, val1=7, val2=3] [L26] COND TRUE i >= -1 VAL [a={-1:0}, i=0, low=2, MAX=100000, SIZE=2, val1=7, val2=3] [L28] COND TRUE i >= 0 VAL [a={-1:0}, i=0, low=2, MAX=100000, SIZE=2, val1=7, val2=3] [L30] a[i] = val1 VAL [a={-1:0}, i=0, low=2, MAX=100000, SIZE=2, val1=7, val2=3] [L32] a[i+1] = val2 VAL [a={-1:0}, i=0, low=2, MAX=100000, SIZE=2, val1=7, val2=3] [L26] i-- VAL [a={-1:0}, i=-1, low=2, MAX=100000, SIZE=2, val1=7, val2=3] [L26] COND TRUE i >= -1 VAL [a={-1:0}, i=-1, low=2, MAX=100000, SIZE=2, val1=7, val2=3] [L28] COND FALSE !(i >= 0) VAL [a={-1:0}, i=-1, low=2, MAX=100000, SIZE=2, val1=7, val2=3] [L32] a[i+1] = val2 VAL [a={-1:0}, i=-1, low=2, MAX=100000, SIZE=2, val1=7, val2=3] [L26] i-- VAL [a={-1:0}, i=-2, low=2, MAX=100000, SIZE=2, val1=7, val2=3] [L26] COND FALSE !(i >= -1) VAL [a={-1:0}, i=-2, low=2, MAX=100000, SIZE=2, val1=7, val2=3] [L35] i = 0 VAL [a={-1:0}, i=0, low=2, MAX=100000, SIZE=2, val1=7, val2=3] [L35] COND TRUE i < SIZE VAL [a={-1:0}, i=0, low=2, MAX=100000, SIZE=2, val1=7, val2=3] [L37] EXPR a[i] VAL [a={-1:0}, a[i]=3, i=0, low=2, MAX=100000, SIZE=2, val1=7, val2=3] [L37] CALL __VERIFIER_assert(a[i] >= low) [L8] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, MAX=100000, SIZE=2] [L37] RET __VERIFIER_assert(a[i] >= low) [L35] i++ VAL [a={-1:0}, i=1, low=2, MAX=100000, SIZE=2, val1=7, val2=3] [L35] COND TRUE i < SIZE VAL [a={-1:0}, i=1, low=2, MAX=100000, SIZE=2, val1=7, val2=3] [L37] EXPR a[i] VAL [a={-1:0}, a[i]=3, i=1, low=2, MAX=100000, SIZE=2, val1=7, val2=3] [L37] CALL __VERIFIER_assert(a[i] >= low) [L8] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, MAX=100000, SIZE=2] [L37] RET __VERIFIER_assert(a[i] >= low) [L35] i++ VAL [a={-1:0}, i=2, low=2, MAX=100000, SIZE=2, val1=7, val2=3] [L35] COND FALSE !(i < SIZE) VAL [a={-1:0}, i=2, low=2, MAX=100000, SIZE=2, val1=7, val2=3] [L40] return 1; VAL [\result=1, a={-1:0}, i=2, low=2, MAX=100000, SIZE=2, val1=7, val2=3] - 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: 8]: 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, 28 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 745 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 745 mSDsluCounter, 498 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 113 IncrementalHoareTripleChecker+Unchecked, 328 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 932 IncrementalHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 170 mSDtfsCounter, 932 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 305 GetRequests, 176 SyntacticMatches, 12 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=11, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 52 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 369 ConstructedInterpolants, 23 QuantifiedInterpolants, 2902 SizeOfPredicates, 35 NumberOfNonLiveVariables, 541 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 21 InterpolantComputations, 6 PerfectInterpolantSequences, 78/145 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 could not prove your program: unable to determine feasibility of some traces [2022-10-15 16:28:48,069 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...