/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-memory-linkedlists/ll_traverse-alloca.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:59:17,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:59:17,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:59:17,558 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:59:17,558 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:59:17,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:59:17,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:59:17,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:59:17,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:59:17,585 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:59:17,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:59:17,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:59:17,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:59:17,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:59:17,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:59:17,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:59:17,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:59:17,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:59:17,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:59:17,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:59:17,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:59:17,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:59:17,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:59:17,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:59:17,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:59:17,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:59:17,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:59:17,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:59:17,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:59:17,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:59:17,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:59:17,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:59:17,647 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:59:17,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:59:17,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:59:17,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:59:17,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:59:17,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:59:17,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:59:17,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:59:17,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:59:17,654 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 17:59:17,709 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:59:17,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:59:17,710 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:59:17,711 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:59:17,713 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:59:17,713 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:59:17,716 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:59:17,716 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:59:17,716 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:59:17,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:59:17,718 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:59:17,718 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:59:17,718 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:59:17,718 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:59:17,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:59:17,719 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:59:17,719 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:59:17,719 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:59:17,719 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:59:17,720 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:59:17,720 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:59:17,720 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:59:17,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:59:17,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:59:17,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:59:17,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:59:17,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:59:17,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:59:17,722 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:59:17,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:59:17,722 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 17:59:18,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:59:18,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:59:18,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:59:18,243 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:59:18,244 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:59:18,245 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-linkedlists/ll_traverse-alloca.i [2022-10-15 17:59:18,333 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d75b9cd71/1cfd1345335b47fabbf30e69b522b02f/FLAG0d77b9581 [2022-10-15 17:59:19,021 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:59:19,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-linkedlists/ll_traverse-alloca.i [2022-10-15 17:59:19,037 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d75b9cd71/1cfd1345335b47fabbf30e69b522b02f/FLAG0d77b9581 [2022-10-15 17:59:19,335 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d75b9cd71/1cfd1345335b47fabbf30e69b522b02f [2022-10-15 17:59:19,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:59:19,348 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:59:19,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:59:19,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:59:19,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:59:19,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:59:19" (1/1) ... [2022-10-15 17:59:19,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9ce777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:19, skipping insertion in model container [2022-10-15 17:59:19,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:59:19" (1/1) ... [2022-10-15 17:59:19,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:59:19,445 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:59:19,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:59:19,814 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:59:19,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:59:19,938 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:59:19,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:19 WrapperNode [2022-10-15 17:59:19,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:59:19,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:59:19,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:59:19,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:59:19,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:19" (1/1) ... [2022-10-15 17:59:19,994 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:19" (1/1) ... [2022-10-15 17:59:20,032 INFO L138 Inliner]: procedures = 114, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 42 [2022-10-15 17:59:20,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:59:20,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:59:20,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:59:20,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:59:20,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:19" (1/1) ... [2022-10-15 17:59:20,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:19" (1/1) ... [2022-10-15 17:59:20,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:19" (1/1) ... [2022-10-15 17:59:20,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:19" (1/1) ... [2022-10-15 17:59:20,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:19" (1/1) ... [2022-10-15 17:59:20,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:19" (1/1) ... [2022-10-15 17:59:20,093 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:19" (1/1) ... [2022-10-15 17:59:20,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:19" (1/1) ... [2022-10-15 17:59:20,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:59:20,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:59:20,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:59:20,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:59:20,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:19" (1/1) ... [2022-10-15 17:59:20,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:59:20,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:59:20,159 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 17:59:20,182 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 17:59:20,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 17:59:20,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 17:59:20,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 17:59:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 17:59:20,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:59:20,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:59:20,359 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:59:20,362 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:59:20,665 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:59:20,675 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:59:20,676 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 17:59:20,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:59:20 BoogieIcfgContainer [2022-10-15 17:59:20,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:59:20,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:59:20,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:59:20,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:59:20,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:59:19" (1/3) ... [2022-10-15 17:59:20,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b06e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:59:20, skipping insertion in model container [2022-10-15 17:59:20,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:19" (2/3) ... [2022-10-15 17:59:20,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b06e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:59:20, skipping insertion in model container [2022-10-15 17:59:20,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:59:20" (3/3) ... [2022-10-15 17:59:20,691 INFO L112 eAbstractionObserver]: Analyzing ICFG ll_traverse-alloca.i [2022-10-15 17:59:20,718 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:59:20,718 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-10-15 17:59:20,799 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:59:20,811 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;@43407c71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:59:20,811 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-10-15 17:59:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 22 states have internal predecessors, (26), 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 17:59:20,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:59:20,836 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:20,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:59:20,838 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-10-15 17:59:20,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:20,861 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-10-15 17:59:20,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:20,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141974896] [2022-10-15 17:59:20,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:20,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:21,136 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 17:59:21,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:21,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141974896] [2022-10-15 17:59:21,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141974896] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:21,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:21,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:59:21,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193567375] [2022-10-15 17:59:21,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:21,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:59:21,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:21,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:59:21,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:21,188 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:21,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:21,251 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-10-15 17:59:21,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:59:21,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 17:59:21,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:21,265 INFO L225 Difference]: With dead ends: 34 [2022-10-15 17:59:21,265 INFO L226 Difference]: Without dead ends: 30 [2022-10-15 17:59:21,268 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 17:59:21,272 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:21,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 35 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:59:21,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-10-15 17:59:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2022-10-15 17:59:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:21,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-10-15 17:59:21,314 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 4 [2022-10-15 17:59:21,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:21,315 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-10-15 17:59:21,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:21,315 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-10-15 17:59:21,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:59:21,316 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:21,316 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:59:21,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:59:21,317 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-10-15 17:59:21,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:21,318 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2022-10-15 17:59:21,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:21,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039518766] [2022-10-15 17:59:21,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:21,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:21,426 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 17:59:21,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:21,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039518766] [2022-10-15 17:59:21,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039518766] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:21,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:21,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:59:21,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336446090] [2022-10-15 17:59:21,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:21,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:59:21,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:21,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:59:21,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:21,431 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:21,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:21,455 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-10-15 17:59:21,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:59:21,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 17:59:21,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:21,457 INFO L225 Difference]: With dead ends: 28 [2022-10-15 17:59:21,457 INFO L226 Difference]: Without dead ends: 28 [2022-10-15 17:59:21,458 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 17:59:21,460 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:21,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 34 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:59:21,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-10-15 17:59:21,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2022-10-15 17:59:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 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 17:59:21,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-10-15 17:59:21,466 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 4 [2022-10-15 17:59:21,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:21,466 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-10-15 17:59:21,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:21,467 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-10-15 17:59:21,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 17:59:21,468 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:21,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:21,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:59:21,468 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-10-15 17:59:21,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:21,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1808167113, now seen corresponding path program 1 times [2022-10-15 17:59:21,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:21,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192372790] [2022-10-15 17:59:21,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:21,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:21,634 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 17:59:21,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:21,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192372790] [2022-10-15 17:59:21,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192372790] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:21,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:21,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:59:21,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374236031] [2022-10-15 17:59:21,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:21,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:59:21,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:21,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:59:21,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:59:21,642 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 17:59:21,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:21,739 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-10-15 17:59:21,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:59:21,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2022-10-15 17:59:21,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:21,741 INFO L225 Difference]: With dead ends: 27 [2022-10-15 17:59:21,742 INFO L226 Difference]: Without dead ends: 27 [2022-10-15 17:59:21,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:59:21,744 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:21,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 49 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:59:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-10-15 17:59:21,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2022-10-15 17:59:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 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 17:59:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-10-15 17:59:21,751 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 7 [2022-10-15 17:59:21,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:21,752 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-10-15 17:59:21,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 17:59:21,752 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-10-15 17:59:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-15 17:59:21,753 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:21,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:21,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:59:21,754 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-10-15 17:59:21,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:21,755 INFO L85 PathProgramCache]: Analyzing trace with hash 218603963, now seen corresponding path program 1 times [2022-10-15 17:59:21,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:21,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788606930] [2022-10-15 17:59:21,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:21,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:21,789 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 17:59:21,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:21,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788606930] [2022-10-15 17:59:21,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788606930] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:21,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:21,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:59:21,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515048486] [2022-10-15 17:59:21,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:21,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:59:21,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:21,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:59:21,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:21,794 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:21,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:21,811 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-10-15 17:59:21,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:59:21,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-15 17:59:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:21,812 INFO L225 Difference]: With dead ends: 23 [2022-10-15 17:59:21,812 INFO L226 Difference]: Without dead ends: 18 [2022-10-15 17:59:21,813 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 17:59:21,815 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:21,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:59:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-10-15 17:59:21,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-10-15 17:59:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 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 17:59:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-10-15 17:59:21,821 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 8 [2022-10-15 17:59:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:21,821 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-10-15 17:59:21,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-10-15 17:59:21,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 17:59:21,823 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:21,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:21,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:59:21,823 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-10-15 17:59:21,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:21,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1419617856, now seen corresponding path program 1 times [2022-10-15 17:59:21,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:21,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577744967] [2022-10-15 17:59:21,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:21,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:21,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:21,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577744967] [2022-10-15 17:59:21,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577744967] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:21,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:21,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:59:21,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305579095] [2022-10-15 17:59:21,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:21,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:59:21,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:21,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:59:22,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:59:22,000 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:22,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:22,106 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-10-15 17:59:22,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:59:22,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 17:59:22,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:22,108 INFO L225 Difference]: With dead ends: 27 [2022-10-15 17:59:22,108 INFO L226 Difference]: Without dead ends: 27 [2022-10-15 17:59:22,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:59:22,111 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 57 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:22,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 12 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:59:22,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-10-15 17:59:22,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2022-10-15 17:59:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 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 17:59:22,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-10-15 17:59:22,117 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-10-15 17:59:22,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:22,117 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-10-15 17:59:22,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-10-15 17:59:22,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 17:59:22,119 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:22,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:22,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 17:59:22,120 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-10-15 17:59:22,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:22,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1419617857, now seen corresponding path program 1 times [2022-10-15 17:59:22,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:22,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079581226] [2022-10-15 17:59:22,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:22,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:22,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:22,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:22,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079581226] [2022-10-15 17:59:22,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079581226] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:22,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:22,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:59:22,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441123094] [2022-10-15 17:59:22,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:22,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:59:22,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:22,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:59:22,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:59:22,482 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:22,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:22,585 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-10-15 17:59:22,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:59:22,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 17:59:22,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:22,587 INFO L225 Difference]: With dead ends: 27 [2022-10-15 17:59:22,587 INFO L226 Difference]: Without dead ends: 27 [2022-10-15 17:59:22,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:59:22,589 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 56 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:22,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 20 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:59:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-10-15 17:59:22,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2022-10-15 17:59:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 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 17:59:22,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-10-15 17:59:22,594 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2022-10-15 17:59:22,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:22,595 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-10-15 17:59:22,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-10-15 17:59:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 17:59:22,596 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:22,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:22,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 17:59:22,597 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-10-15 17:59:22,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:22,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1058478884, now seen corresponding path program 1 times [2022-10-15 17:59:22,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:22,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655843455] [2022-10-15 17:59:22,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:22,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:22,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:22,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655843455] [2022-10-15 17:59:22,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655843455] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:22,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:22,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:59:22,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679012703] [2022-10-15 17:59:22,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:22,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:59:22,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:22,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:59:22,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:59:22,735 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 17:59:22,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:22,828 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-10-15 17:59:22,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:59:22,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2022-10-15 17:59:22,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:22,831 INFO L225 Difference]: With dead ends: 24 [2022-10-15 17:59:22,831 INFO L226 Difference]: Without dead ends: 24 [2022-10-15 17:59:22,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:59:22,840 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 46 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:22,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 28 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:59:22,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-10-15 17:59:22,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-10-15 17:59:22,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 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 17:59:22,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-10-15 17:59:22,856 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2022-10-15 17:59:22,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:22,856 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-10-15 17:59:22,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 17:59:22,861 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-10-15 17:59:22,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 17:59:22,862 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:22,862 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:22,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 17:59:22,863 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-10-15 17:59:22,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:22,866 INFO L85 PathProgramCache]: Analyzing trace with hash -707407799, now seen corresponding path program 1 times [2022-10-15 17:59:22,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:22,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141576883] [2022-10-15 17:59:22,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:22,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:23,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:23,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:23,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141576883] [2022-10-15 17:59:23,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141576883] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:59:23,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387815777] [2022-10-15 17:59:23,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:23,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:59:23,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:59:23,459 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:59:23,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 17:59:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:23,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 47 conjunts are in the unsatisfiable core [2022-10-15 17:59:23,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:59:23,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 17:59:23,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 17:59:23,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-15 17:59:23,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-15 17:59:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:23,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:59:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:23,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387815777] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:59:23,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:59:23,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 14 [2022-10-15 17:59:23,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745736806] [2022-10-15 17:59:23,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:59:23,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-15 17:59:23,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:23,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-15 17:59:23,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-10-15 17:59:23,953 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:24,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:24,237 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-10-15 17:59:24,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 17:59:24,237 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 17:59:24,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:24,238 INFO L225 Difference]: With dead ends: 35 [2022-10-15 17:59:24,238 INFO L226 Difference]: Without dead ends: 35 [2022-10-15 17:59:24,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-10-15 17:59:24,240 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 47 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:24,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 90 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:59:24,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-10-15 17:59:24,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-10-15 17:59:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-10-15 17:59:24,245 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 15 [2022-10-15 17:59:24,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:24,245 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-10-15 17:59:24,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:24,246 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-10-15 17:59:24,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 17:59:24,247 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:24,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:24,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-15 17:59:24,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:59:24,461 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-10-15 17:59:24,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:24,462 INFO L85 PathProgramCache]: Analyzing trace with hash -454806981, now seen corresponding path program 1 times [2022-10-15 17:59:24,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:24,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068320769] [2022-10-15 17:59:24,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:24,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:59:24,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 17:59:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:59:24,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 17:59:24,523 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 17:59:24,524 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2022-10-15 17:59:24,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2022-10-15 17:59:24,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2022-10-15 17:59:24,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2022-10-15 17:59:24,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2022-10-15 17:59:24,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2022-10-15 17:59:24,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 7 remaining) [2022-10-15 17:59:24,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 17:59:24,541 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:24,546 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:59:24,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:59:24 BoogieIcfgContainer [2022-10-15 17:59:24,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:59:24,612 INFO L158 Benchmark]: Toolchain (without parser) took 5267.76ms. Allocated memory was 158.3MB in the beginning and 195.0MB in the end (delta: 36.7MB). Free memory was 130.9MB in the beginning and 132.4MB in the end (delta: -1.5MB). Peak memory consumption was 35.8MB. Max. memory is 8.0GB. [2022-10-15 17:59:24,612 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 158.3MB. Free memory was 127.7MB in the beginning and 127.6MB in the end (delta: 82.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:59:24,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 585.29ms. Allocated memory is still 158.3MB. Free memory was 130.8MB in the beginning and 115.3MB in the end (delta: 15.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-10-15 17:59:24,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.93ms. Allocated memory is still 158.3MB. Free memory was 115.3MB in the beginning and 113.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:59:24,614 INFO L158 Benchmark]: Boogie Preprocessor took 70.10ms. Allocated memory is still 158.3MB. Free memory was 113.5MB in the beginning and 112.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:59:24,614 INFO L158 Benchmark]: RCFGBuilder took 570.51ms. Allocated memory is still 158.3MB. Free memory was 112.1MB in the beginning and 136.2MB in the end (delta: -24.1MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-10-15 17:59:24,615 INFO L158 Benchmark]: TraceAbstraction took 3926.98ms. Allocated memory was 158.3MB in the beginning and 195.0MB in the end (delta: 36.7MB). Free memory was 135.7MB in the beginning and 132.4MB in the end (delta: 3.3MB). Peak memory consumption was 39.5MB. Max. memory is 8.0GB. [2022-10-15 17:59:24,618 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.29ms. Allocated memory is still 158.3MB. Free memory was 127.7MB in the beginning and 127.6MB in the end (delta: 82.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 585.29ms. Allocated memory is still 158.3MB. Free memory was 130.8MB in the beginning and 115.3MB in the end (delta: 15.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 92.93ms. Allocated memory is still 158.3MB. Free memory was 115.3MB in the beginning and 113.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 70.10ms. Allocated memory is still 158.3MB. Free memory was 113.5MB in the beginning and 112.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 570.51ms. Allocated memory is still 158.3MB. Free memory was 112.1MB in the beginning and 136.2MB in the end (delta: -24.1MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3926.98ms. Allocated memory was 158.3MB in the beginning and 195.0MB in the end (delta: 36.7MB). Free memory was 135.7MB in the beginning and 132.4MB in the end (delta: 3.3MB). Peak memory consumption was 39.5MB. 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 565. Possible FailurePath: [L567] int n = __VERIFIER_nondet_int(); [L568] CALL, EXPR init_ll(n) [L548] node_t* head = ((void *)0); [L549] node_t* curr; [L550] int i = 0; VAL [\old(n)=1, head={0:0}, i=0, n=1] [L550] COND TRUE i < n [L551] curr = malloc(sizeof(node_t)) [L552] curr->val = i VAL [\old(n)=1, curr={-1:0}, head={0:0}, i=0, n=1] [L553] curr->next = head VAL [\old(n)=1, curr={-1:0}, head={0:0}, i=0, n=1] [L554] head = curr VAL [\old(n)=1, curr={-1:0}, head={-1:0}, i=0, n=1] [L550] i++ VAL [\old(n)=1, curr={-1:0}, head={-1:0}, i=1, n=1] [L550] COND FALSE !(i < n) VAL [\old(n)=1, curr={-1:0}, head={-1:0}, i=1, n=1] [L556] return head; VAL [\old(n)=1, \result={-1:0}, curr={-1:0}, head={-1:0}, i=1, n=1] [L568] RET, EXPR init_ll(n) [L568] node_t* head = init_ll(n); [L569] CALL traverse(head) [L560] node_t* curr = head; VAL [curr={-1:0}, head={-1:0}, head={-1:0}] [L561] COND TRUE curr != ((void *)0) VAL [curr={-1:0}, head={-1:0}, head={-1:0}] [L562] EXPR curr->next VAL [curr={-1:0}, curr->next={0:0}, head={-1:0}, head={-1:0}] [L562] curr = curr->next [L561] COND FALSE !(curr != ((void *)0)) VAL [curr={0:0}, head={-1:0}, head={-1:0}] [L569] RET traverse(head) [L570] return 0; VAL [\result=0, head={-1:0}, n=1] - 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 1 procedures, 23 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 257 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 257 mSDsluCounter, 295 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 176 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 260 IncrementalHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 119 mSDtfsCounter, 260 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=8, InterpolantAutomatonStates: 45, 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, 8 MinimizatonAttempts, 50 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 761 SizeOfPredicates, 18 NumberOfNonLiveVariables, 109 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 6/12 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 17:59:24,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...