/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/termination-recursive-malloc/rec_malloc_ex10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 18:00:21,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 18:00:21,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 18:00:21,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 18:00:21,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 18:00:21,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 18:00:21,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 18:00:21,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 18:00:21,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 18:00:21,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 18:00:21,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 18:00:21,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 18:00:21,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 18:00:21,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 18:00:21,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 18:00:21,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 18:00:21,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 18:00:21,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 18:00:21,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 18:00:21,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 18:00:21,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 18:00:21,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 18:00:21,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 18:00:21,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 18:00:21,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 18:00:21,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 18:00:21,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 18:00:21,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 18:00:21,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 18:00:21,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 18:00:21,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 18:00:21,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 18:00:21,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 18:00:21,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 18:00:21,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 18:00:21,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 18:00:21,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 18:00:21,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 18:00:21,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 18:00:21,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 18:00:21,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 18:00:21,527 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 18:00:21,584 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 18:00:21,585 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 18:00:21,586 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 18:00:21,586 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 18:00:21,588 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 18:00:21,589 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 18:00:21,591 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 18:00:21,592 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 18:00:21,592 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 18:00:21,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 18:00:21,593 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 18:00:21,594 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 18:00:21,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 18:00:21,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 18:00:21,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 18:00:21,595 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 18:00:21,595 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 18:00:21,595 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 18:00:21,595 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 18:00:21,595 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 18:00:21,596 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 18:00:21,596 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 18:00:21,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 18:00:21,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 18:00:21,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 18:00:21,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 18:00:21,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 18:00:21,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 18:00:21,597 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 18:00:21,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 18:00:21,598 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 18:00:22,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 18:00:22,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 18:00:22,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 18:00:22,078 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 18:00:22,078 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 18:00:22,080 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex10.i [2022-10-15 18:00:22,171 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4ef4559f/fdde19f96da540f1a0de515f91d51ae6/FLAG54e7a97fd [2022-10-15 18:00:22,791 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 18:00:22,792 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex10.i [2022-10-15 18:00:22,801 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4ef4559f/fdde19f96da540f1a0de515f91d51ae6/FLAG54e7a97fd [2022-10-15 18:00:23,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4ef4559f/fdde19f96da540f1a0de515f91d51ae6 [2022-10-15 18:00:23,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 18:00:23,159 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 18:00:23,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 18:00:23,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 18:00:23,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 18:00:23,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:00:23" (1/1) ... [2022-10-15 18:00:23,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f9fe597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:23, skipping insertion in model container [2022-10-15 18:00:23,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:00:23" (1/1) ... [2022-10-15 18:00:23,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 18:00:23,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 18:00:23,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 18:00:23,394 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 18:00:23,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 18:00:23,436 INFO L208 MainTranslator]: Completed translation [2022-10-15 18:00:23,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:23 WrapperNode [2022-10-15 18:00:23,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 18:00:23,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 18:00:23,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 18:00:23,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 18:00:23,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:23" (1/1) ... [2022-10-15 18:00:23,463 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:23" (1/1) ... [2022-10-15 18:00:23,487 INFO L138 Inliner]: procedures = 12, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2022-10-15 18:00:23,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 18:00:23,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 18:00:23,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 18:00:23,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 18:00:23,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:23" (1/1) ... [2022-10-15 18:00:23,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:23" (1/1) ... [2022-10-15 18:00:23,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:23" (1/1) ... [2022-10-15 18:00:23,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:23" (1/1) ... [2022-10-15 18:00:23,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:23" (1/1) ... [2022-10-15 18:00:23,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:23" (1/1) ... [2022-10-15 18:00:23,539 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:23" (1/1) ... [2022-10-15 18:00:23,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:23" (1/1) ... [2022-10-15 18:00:23,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 18:00:23,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 18:00:23,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 18:00:23,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 18:00:23,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:23" (1/1) ... [2022-10-15 18:00:23,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 18:00:23,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 18:00:23,594 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 18:00:23,620 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 18:00:23,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 18:00:23,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 18:00:23,666 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-10-15 18:00:23,667 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-10-15 18:00:23,667 INFO L130 BoogieDeclarations]: Found specification of procedure g [2022-10-15 18:00:23,667 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2022-10-15 18:00:23,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 18:00:23,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 18:00:23,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 18:00:23,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 18:00:23,755 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 18:00:23,759 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 18:00:24,154 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 18:00:24,163 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 18:00:24,164 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 18:00:24,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:00:24 BoogieIcfgContainer [2022-10-15 18:00:24,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 18:00:24,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 18:00:24,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 18:00:24,174 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 18:00:24,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:00:23" (1/3) ... [2022-10-15 18:00:24,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488e9180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:00:24, skipping insertion in model container [2022-10-15 18:00:24,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:00:23" (2/3) ... [2022-10-15 18:00:24,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488e9180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:00:24, skipping insertion in model container [2022-10-15 18:00:24,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:00:24" (3/3) ... [2022-10-15 18:00:24,178 INFO L112 eAbstractionObserver]: Analyzing ICFG rec_malloc_ex10.i [2022-10-15 18:00:24,202 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 18:00:24,202 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-10-15 18:00:24,304 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 18:00:24,314 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;@3dfa5b93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 18:00:24,314 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-10-15 18:00:24,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 46 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 18:00:24,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 18:00:24,331 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:24,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 18:00:24,332 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:24,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:24,340 INFO L85 PathProgramCache]: Analyzing trace with hash 68584, now seen corresponding path program 1 times [2022-10-15 18:00:24,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:24,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075980661] [2022-10-15 18:00:24,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:24,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:24,840 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 18:00:24,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:24,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075980661] [2022-10-15 18:00:24,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075980661] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:24,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:24,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:00:24,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978019463] [2022-10-15 18:00:24,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:24,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:00:24,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:24,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:00:24,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:00:24,896 INFO L87 Difference]: Start difference. First operand has 50 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 46 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:25,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:25,010 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-10-15 18:00:25,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:00:25,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-10-15 18:00:25,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:25,031 INFO L225 Difference]: With dead ends: 49 [2022-10-15 18:00:25,031 INFO L226 Difference]: Without dead ends: 47 [2022-10-15 18:00:25,035 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 18:00:25,044 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 7 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:25,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 18:00:25,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-15 18:00:25,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-10-15 18:00:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 43 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 18:00:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-10-15 18:00:25,101 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 3 [2022-10-15 18:00:25,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:25,102 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-10-15 18:00:25,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-10-15 18:00:25,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 18:00:25,103 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:25,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 18:00:25,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 18:00:25,104 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:25,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:25,105 INFO L85 PathProgramCache]: Analyzing trace with hash 68585, now seen corresponding path program 1 times [2022-10-15 18:00:25,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:25,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630695231] [2022-10-15 18:00:25,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:25,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:25,261 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 18:00:25,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:25,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630695231] [2022-10-15 18:00:25,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630695231] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:25,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:25,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:00:25,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656669462] [2022-10-15 18:00:25,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:25,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:00:25,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:25,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:00:25,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:00:25,271 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:25,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:25,319 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-10-15 18:00:25,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:00:25,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-10-15 18:00:25,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:25,321 INFO L225 Difference]: With dead ends: 46 [2022-10-15 18:00:25,321 INFO L226 Difference]: Without dead ends: 46 [2022-10-15 18:00:25,322 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 18:00:25,323 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:25,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 71 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 18:00:25,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-15 18:00:25,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-10-15 18:00:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 23 states have (on average 1.826086956521739) internal successors, (42), 42 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 18:00:25,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2022-10-15 18:00:25,341 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 3 [2022-10-15 18:00:25,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:25,341 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2022-10-15 18:00:25,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-10-15 18:00:25,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 18:00:25,342 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:25,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 18:00:25,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 18:00:25,346 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:25,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:25,347 INFO L85 PathProgramCache]: Analyzing trace with hash 65909706, now seen corresponding path program 1 times [2022-10-15 18:00:25,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:25,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056946059] [2022-10-15 18:00:25,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:25,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:25,476 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 18:00:25,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:25,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056946059] [2022-10-15 18:00:25,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056946059] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:25,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:25,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:00:25,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764958926] [2022-10-15 18:00:25,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:25,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:00:25,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:25,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:00:25,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:00:25,480 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:25,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:25,521 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-10-15 18:00:25,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:00:25,522 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 18:00:25,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:25,523 INFO L225 Difference]: With dead ends: 45 [2022-10-15 18:00:25,524 INFO L226 Difference]: Without dead ends: 45 [2022-10-15 18:00:25,524 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 18:00:25,526 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 3 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:25,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 70 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 18:00:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-10-15 18:00:25,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-10-15 18:00:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 41 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 18:00:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-10-15 18:00:25,536 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 5 [2022-10-15 18:00:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:25,536 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-10-15 18:00:25,537 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 18:00:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-10-15 18:00:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 18:00:25,537 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:25,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 18:00:25,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 18:00:25,538 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:25,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:25,539 INFO L85 PathProgramCache]: Analyzing trace with hash 65909705, now seen corresponding path program 1 times [2022-10-15 18:00:25,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:25,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102091723] [2022-10-15 18:00:25,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:25,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:25,594 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 18:00:25,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:25,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102091723] [2022-10-15 18:00:25,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102091723] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:25,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:25,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:00:25,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248204998] [2022-10-15 18:00:25,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:25,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:00:25,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:25,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:00:25,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:00:25,598 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:25,655 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-10-15 18:00:25,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:00:25,656 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 18:00:25,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:25,657 INFO L225 Difference]: With dead ends: 44 [2022-10-15 18:00:25,657 INFO L226 Difference]: Without dead ends: 44 [2022-10-15 18:00:25,659 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 18:00:25,663 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 2 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:25,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 18:00:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-10-15 18:00:25,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-10-15 18:00:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 40 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 18:00:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-10-15 18:00:25,681 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 5 [2022-10-15 18:00:25,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:25,681 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-10-15 18:00:25,681 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 18:00:25,682 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-10-15 18:00:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 18:00:25,682 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:25,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:25,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 18:00:25,690 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:25,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:25,691 INFO L85 PathProgramCache]: Analyzing trace with hash 720745332, now seen corresponding path program 1 times [2022-10-15 18:00:25,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:25,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703049941] [2022-10-15 18:00:25,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:25,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:25,810 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 18:00:25,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:25,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703049941] [2022-10-15 18:00:25,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703049941] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:25,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:25,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 18:00:25,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710394843] [2022-10-15 18:00:25,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:25,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 18:00:25,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:25,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 18:00:25,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 18:00:25,818 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:25,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:25,976 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2022-10-15 18:00:25,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 18:00:25,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-15 18:00:25,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:25,981 INFO L225 Difference]: With dead ends: 66 [2022-10-15 18:00:25,981 INFO L226 Difference]: Without dead ends: 66 [2022-10-15 18:00:25,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 18:00:25,983 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 51 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:25,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 74 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 18:00:25,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-10-15 18:00:25,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2022-10-15 18:00:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 18:00:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-10-15 18:00:25,997 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 9 [2022-10-15 18:00:25,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:25,997 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-10-15 18:00:25,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:25,998 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-10-15 18:00:25,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 18:00:25,999 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:25,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:25,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 18:00:26,000 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:26,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:26,001 INFO L85 PathProgramCache]: Analyzing trace with hash 720745333, now seen corresponding path program 1 times [2022-10-15 18:00:26,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:26,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313372242] [2022-10-15 18:00:26,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:26,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:26,208 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 18:00:26,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:26,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313372242] [2022-10-15 18:00:26,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313372242] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:26,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:26,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 18:00:26,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721508592] [2022-10-15 18:00:26,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:26,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 18:00:26,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:26,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 18:00:26,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 18:00:26,212 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:26,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:26,355 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-10-15 18:00:26,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 18:00:26,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-15 18:00:26,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:26,357 INFO L225 Difference]: With dead ends: 64 [2022-10-15 18:00:26,358 INFO L226 Difference]: Without dead ends: 64 [2022-10-15 18:00:26,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-15 18:00:26,360 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 38 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:26,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 97 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 18:00:26,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-10-15 18:00:26,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2022-10-15 18:00:26,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.606060606060606) internal successors, (53), 48 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 18:00:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-10-15 18:00:26,371 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 9 [2022-10-15 18:00:26,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:26,371 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-10-15 18:00:26,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-10-15 18:00:26,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 18:00:26,372 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:26,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:26,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 18:00:26,373 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:26,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:26,374 INFO L85 PathProgramCache]: Analyzing trace with hash 868268786, now seen corresponding path program 1 times [2022-10-15 18:00:26,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:26,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531388439] [2022-10-15 18:00:26,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:26,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:26,450 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 18:00:26,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:26,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531388439] [2022-10-15 18:00:26,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531388439] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:26,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:26,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 18:00:26,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510382088] [2022-10-15 18:00:26,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:26,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 18:00:26,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:26,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 18:00:26,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 18:00:26,454 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:26,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:26,551 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-10-15 18:00:26,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 18:00:26,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-15 18:00:26,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:26,553 INFO L225 Difference]: With dead ends: 62 [2022-10-15 18:00:26,553 INFO L226 Difference]: Without dead ends: 62 [2022-10-15 18:00:26,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 18:00:26,555 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 41 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:26,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 84 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 18:00:26,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-10-15 18:00:26,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2022-10-15 18:00:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 18:00:26,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-10-15 18:00:26,564 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 10 [2022-10-15 18:00:26,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:26,564 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-10-15 18:00:26,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:26,565 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-10-15 18:00:26,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 18:00:26,565 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:26,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:26,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 18:00:26,566 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting fErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:26,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:26,567 INFO L85 PathProgramCache]: Analyzing trace with hash 868268787, now seen corresponding path program 1 times [2022-10-15 18:00:26,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:26,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138651809] [2022-10-15 18:00:26,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:26,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:26,739 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 18:00:26,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:26,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138651809] [2022-10-15 18:00:26,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138651809] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:26,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:26,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 18:00:26,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386306800] [2022-10-15 18:00:26,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:26,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 18:00:26,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:26,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 18:00:26,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 18:00:26,743 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:26,820 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-10-15 18:00:26,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 18:00:26,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-15 18:00:26,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:26,822 INFO L225 Difference]: With dead ends: 62 [2022-10-15 18:00:26,822 INFO L226 Difference]: Without dead ends: 62 [2022-10-15 18:00:26,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 18:00:26,824 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 27 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:26,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 104 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 18:00:26,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-10-15 18:00:26,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2022-10-15 18:00:26,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 48 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 18:00:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-10-15 18:00:26,832 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 10 [2022-10-15 18:00:26,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:26,832 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-10-15 18:00:26,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:26,833 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-10-15 18:00:26,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 18:00:26,833 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:26,834 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:26,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 18:00:26,834 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting fErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:26,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:26,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1992639906, now seen corresponding path program 1 times [2022-10-15 18:00:26,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:26,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011402777] [2022-10-15 18:00:26,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:26,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:26,933 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 18:00:26,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:26,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011402777] [2022-10-15 18:00:26,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011402777] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:26,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:26,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:00:26,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346881920] [2022-10-15 18:00:26,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:26,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:00:26,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:26,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:00:26,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:00:26,938 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:26,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:26,971 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-10-15 18:00:26,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:00:26,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-15 18:00:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:26,973 INFO L225 Difference]: With dead ends: 53 [2022-10-15 18:00:26,973 INFO L226 Difference]: Without dead ends: 53 [2022-10-15 18:00:26,974 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 18:00:26,975 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 9 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:26,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 58 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 18:00:26,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-10-15 18:00:26,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-10-15 18:00:26,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 47 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 18:00:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-10-15 18:00:26,988 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 13 [2022-10-15 18:00:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:26,988 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-10-15 18:00:26,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-10-15 18:00:26,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 18:00:26,989 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:26,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:26,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 18:00:26,990 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting fErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:26,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:26,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1992639907, now seen corresponding path program 1 times [2022-10-15 18:00:26,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:26,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700368323] [2022-10-15 18:00:26,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:26,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 18:00:27,035 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 18:00:27,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 18:00:27,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700368323] [2022-10-15 18:00:27,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700368323] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 18:00:27,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 18:00:27,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 18:00:27,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900159529] [2022-10-15 18:00:27,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 18:00:27,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 18:00:27,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 18:00:27,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 18:00:27,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 18:00:27,039 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:27,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 18:00:27,062 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-10-15 18:00:27,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 18:00:27,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-15 18:00:27,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 18:00:27,064 INFO L225 Difference]: With dead ends: 52 [2022-10-15 18:00:27,064 INFO L226 Difference]: Without dead ends: 52 [2022-10-15 18:00:27,064 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 18:00:27,065 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 18:00:27,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 18:00:27,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-10-15 18:00:27,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-10-15 18:00:27,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 18:00:27,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-10-15 18:00:27,072 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 13 [2022-10-15 18:00:27,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 18:00:27,072 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-10-15 18:00:27,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 18:00:27,072 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-10-15 18:00:27,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 18:00:27,073 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 18:00:27,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:27,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 18:00:27,074 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 18:00:27,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 18:00:27,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1642309863, now seen corresponding path program 1 times [2022-10-15 18:00:27,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 18:00:27,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480843224] [2022-10-15 18:00:27,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 18:00:27,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 18:00:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 18:00:27,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 18:00:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 18:00:27,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 18:00:27,149 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 18:00:27,150 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2022-10-15 18:00:27,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2022-10-15 18:00:27,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2022-10-15 18:00:27,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2022-10-15 18:00:27,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2022-10-15 18:00:27,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2022-10-15 18:00:27,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2022-10-15 18:00:27,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2022-10-15 18:00:27,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2022-10-15 18:00:27,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr8ASSERT_VIOLATIONMEMORY_FREE (10 of 20 remaining) [2022-10-15 18:00:27,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr9ASSERT_VIOLATIONMEMORY_FREE (9 of 20 remaining) [2022-10-15 18:00:27,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr10ASSERT_VIOLATIONMEMORY_FREE (8 of 20 remaining) [2022-10-15 18:00:27,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location gErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2022-10-15 18:00:27,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location gErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2022-10-15 18:00:27,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location gErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2022-10-15 18:00:27,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location gErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2022-10-15 18:00:27,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2022-10-15 18:00:27,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 20 remaining) [2022-10-15 18:00:27,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 20 remaining) [2022-10-15 18:00:27,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 20 remaining) [2022-10-15 18:00:27,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 18:00:27,163 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 18:00:27,172 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 18:00:27,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:00:27 BoogieIcfgContainer [2022-10-15 18:00:27,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 18:00:27,213 INFO L158 Benchmark]: Toolchain (without parser) took 4057.94ms. Allocated memory was 152.0MB in the beginning and 188.7MB in the end (delta: 36.7MB). Free memory was 126.1MB in the beginning and 87.0MB in the end (delta: 39.1MB). Peak memory consumption was 76.6MB. Max. memory is 8.0GB. [2022-10-15 18:00:27,219 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 152.0MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 18:00:27,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.44ms. Allocated memory is still 152.0MB. Free memory was 125.9MB in the beginning and 116.6MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-10-15 18:00:27,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.20ms. Allocated memory is still 152.0MB. Free memory was 116.4MB in the beginning and 115.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 18:00:27,225 INFO L158 Benchmark]: Boogie Preprocessor took 60.85ms. Allocated memory is still 152.0MB. Free memory was 115.0MB in the beginning and 113.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 18:00:27,230 INFO L158 Benchmark]: RCFGBuilder took 616.44ms. Allocated memory is still 152.0MB. Free memory was 113.9MB in the beginning and 100.6MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-15 18:00:27,231 INFO L158 Benchmark]: TraceAbstraction took 3041.95ms. Allocated memory was 152.0MB in the beginning and 188.7MB in the end (delta: 36.7MB). Free memory was 99.7MB in the beginning and 87.0MB in the end (delta: 12.7MB). Peak memory consumption was 50.4MB. Max. memory is 8.0GB. [2022-10-15 18:00:27,234 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.26ms. Allocated memory is still 152.0MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 277.44ms. Allocated memory is still 152.0MB. Free memory was 125.9MB in the beginning and 116.6MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.20ms. Allocated memory is still 152.0MB. Free memory was 116.4MB in the beginning and 115.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.85ms. Allocated memory is still 152.0MB. Free memory was 115.0MB in the beginning and 113.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 616.44ms. Allocated memory is still 152.0MB. Free memory was 113.9MB in the beginning and 100.6MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3041.95ms. Allocated memory was 152.0MB in the beginning and 188.7MB in the end (delta: 36.7MB). Free memory was 99.7MB in the beginning and 87.0MB in the end (delta: 12.7MB). Peak memory consumption was 50.4MB. 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: 41]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 41. Possible FailurePath: [L43] int *p1 = malloc(sizeof(int)); [L44] int *p2 = malloc(sizeof(int)); [L46] *p1 = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, p1={-3:0}, p2={-2:0}] [L47] *p2 = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, p1={-3:0}, p2={-2:0}] [L49] CALL f(p1,p2) VAL [p={-3:0}, q={-2:0}] [L13] EXPR \read(*p) VAL [\read(*p)=-1, p={-3:0}, p={-3:0}, q={-2:0}, q={-2:0}] [L13] EXPR \read(*q) VAL [\read(*p)=-1, \read(*q)=0, p={-3:0}, p={-3:0}, q={-2:0}, q={-2:0}] [L13] COND TRUE *p + *q < 0 [L49] RET f(p1,p2) VAL [p1={-3:0}, p2={-2:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 191 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 751 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 370 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 418 IncrementalHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 381 mSDtfsCounter, 418 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=6, InterpolantAutomatonStates: 41, 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, 10 MinimizatonAttempts, 42 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 308 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 18:00:27,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...