/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-dietlibc/strlcpy.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:55:44,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:55:44,916 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:55:44,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:55:44,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:55:44,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:55:44,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:55:44,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:55:44,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:55:44,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:55:44,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:55:44,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:55:44,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:55:44,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:55:44,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:55:44,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:55:45,000 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:55:45,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:55:45,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:55:45,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:55:45,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:55:45,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:55:45,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:55:45,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:55:45,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:55:45,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:55:45,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:55:45,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:55:45,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:55:45,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:55:45,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:55:45,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:55:45,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:55:45,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:55:45,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:55:45,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:55:45,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:55:45,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:55:45,031 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:55:45,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:55:45,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:55:45,034 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:55:45,065 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:55:45,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:55:45,066 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:55:45,067 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:55:45,068 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:55:45,068 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:55:45,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:55:45,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:55:45,070 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:55:45,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:55:45,072 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:55:45,072 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:55:45,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:55:45,073 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:55:45,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:55:45,073 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:55:45,074 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:55:45,074 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:55:45,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:55:45,074 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:55:45,076 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:55:45,076 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:55:45,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:55:45,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:55:45,077 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:55:45,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:55:45,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:55:45,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:55:45,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:55:45,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:55:45,079 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:55:45,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:55:45,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:55:45,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:55:45,571 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:55:45,572 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:55:45,573 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strlcpy.i [2022-10-15 17:55:45,663 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc95728b8/e6ca690a4ee44c50bc506d8c5ee9f14e/FLAG162c76c0f [2022-10-15 17:55:46,378 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:55:46,382 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strlcpy.i [2022-10-15 17:55:46,407 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc95728b8/e6ca690a4ee44c50bc506d8c5ee9f14e/FLAG162c76c0f [2022-10-15 17:55:46,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc95728b8/e6ca690a4ee44c50bc506d8c5ee9f14e [2022-10-15 17:55:46,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:55:46,675 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:55:46,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:55:46,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:55:46,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:55:46,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:55:46" (1/1) ... [2022-10-15 17:55:46,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c2305e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:46, skipping insertion in model container [2022-10-15 17:55:46,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:55:46" (1/1) ... [2022-10-15 17:55:46,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:55:46,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:55:47,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:55:47,346 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:55:47,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:55:47,465 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:55:47,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:47 WrapperNode [2022-10-15 17:55:47,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:55:47,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:55:47,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:55:47,467 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:55:47,477 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:55:47" (1/1) ... [2022-10-15 17:55:47,511 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:55:47" (1/1) ... [2022-10-15 17:55:47,541 INFO L138 Inliner]: procedures = 113, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2022-10-15 17:55:47,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:55:47,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:55:47,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:55:47,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:55:47,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:47" (1/1) ... [2022-10-15 17:55:47,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:47" (1/1) ... [2022-10-15 17:55:47,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:47" (1/1) ... [2022-10-15 17:55:47,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:47" (1/1) ... [2022-10-15 17:55:47,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:47" (1/1) ... [2022-10-15 17:55:47,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:47" (1/1) ... [2022-10-15 17:55:47,572 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:47" (1/1) ... [2022-10-15 17:55:47,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:47" (1/1) ... [2022-10-15 17:55:47,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:55:47,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:55:47,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:55:47,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:55:47,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:47" (1/1) ... [2022-10-15 17:55:47,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:55:47,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:47,624 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:55:47,646 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:55:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 17:55:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 17:55:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 17:55:47,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 17:55:47,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:55:47,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:55:47,791 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:55:47,793 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:55:48,150 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:55:48,174 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:55:48,174 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 17:55:48,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:55:48 BoogieIcfgContainer [2022-10-15 17:55:48,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:55:48,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:55:48,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:55:48,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:55:48,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:55:46" (1/3) ... [2022-10-15 17:55:48,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d54bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:55:48, skipping insertion in model container [2022-10-15 17:55:48,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:47" (2/3) ... [2022-10-15 17:55:48,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d54bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:55:48, skipping insertion in model container [2022-10-15 17:55:48,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:55:48" (3/3) ... [2022-10-15 17:55:48,208 INFO L112 eAbstractionObserver]: Analyzing ICFG strlcpy.i [2022-10-15 17:55:48,265 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:55:48,265 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-10-15 17:55:48,350 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:55:48,360 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;@5eac42ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:55:48,361 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-10-15 17:55:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 35 states have internal predecessors, (46), 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:55:48,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:55:48,374 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:48,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:55:48,376 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-10-15 17:55:48,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:48,383 INFO L85 PathProgramCache]: Analyzing trace with hash 925686, now seen corresponding path program 1 times [2022-10-15 17:55:48,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:48,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813897356] [2022-10-15 17:55:48,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:48,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:48,593 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:55:48,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:48,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813897356] [2022-10-15 17:55:48,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813897356] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:48,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:48,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:55:48,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285697314] [2022-10-15 17:55:48,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:48,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:55:48,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:48,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:55:48,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:48,643 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 35 states have internal predecessors, (46), 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:55:48,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:48,712 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-10-15 17:55:48,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:55:48,715 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:55:48,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:48,726 INFO L225 Difference]: With dead ends: 37 [2022-10-15 17:55:48,726 INFO L226 Difference]: Without dead ends: 34 [2022-10-15 17:55:48,728 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:55:48,734 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:48,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:48,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-10-15 17:55:48,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-10-15 17:55:48,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 33 states have internal predecessors, (41), 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:55:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-10-15 17:55:48,778 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 4 [2022-10-15 17:55:48,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:48,779 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-10-15 17:55:48,780 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:55:48,780 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-10-15 17:55:48,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:55:48,781 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:48,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:55:48,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:55:48,782 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-10-15 17:55:48,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:48,783 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-10-15 17:55:48,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:48,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541593789] [2022-10-15 17:55:48,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:48,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:48,966 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:55:48,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:48,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541593789] [2022-10-15 17:55:48,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541593789] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:48,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:48,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:55:48,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312871298] [2022-10-15 17:55:48,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:48,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:55:48,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:48,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:55:48,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:48,972 INFO L87 Difference]: Start difference. First operand 34 states and 41 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:55:49,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:49,009 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-10-15 17:55:49,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:55:49,010 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:55:49,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:49,011 INFO L225 Difference]: With dead ends: 33 [2022-10-15 17:55:49,011 INFO L226 Difference]: Without dead ends: 33 [2022-10-15 17:55:49,012 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:55:49,014 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:49,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 27 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:49,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-10-15 17:55:49,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-10-15 17:55:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 32 states have internal predecessors, (40), 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:55:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-10-15 17:55:49,021 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 4 [2022-10-15 17:55:49,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:49,022 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-10-15 17:55:49,022 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:55:49,023 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-10-15 17:55:49,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:55:49,023 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:49,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:55:49,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:55:49,024 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-10-15 17:55:49,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:49,025 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2022-10-15 17:55:49,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:49,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344353453] [2022-10-15 17:55:49,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:49,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:49,258 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:55:49,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:49,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344353453] [2022-10-15 17:55:49,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344353453] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:49,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:49,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:55:49,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316565813] [2022-10-15 17:55:49,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:49,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:55:49,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:49,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:55:49,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:49,262 INFO L87 Difference]: Start difference. First operand 33 states and 40 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:55:49,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:49,293 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-10-15 17:55:49,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:55:49,294 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:55:49,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:49,295 INFO L225 Difference]: With dead ends: 34 [2022-10-15 17:55:49,296 INFO L226 Difference]: Without dead ends: 34 [2022-10-15 17:55:49,296 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:55:49,298 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:49,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 62 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:49,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-10-15 17:55:49,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-10-15 17:55:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:49,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-10-15 17:55:49,306 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 4 [2022-10-15 17:55:49,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:49,306 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-10-15 17:55:49,307 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:55:49,307 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-10-15 17:55:49,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 17:55:49,308 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:49,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:49,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:55:49,308 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-10-15 17:55:49,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:49,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782705, now seen corresponding path program 1 times [2022-10-15 17:55:49,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:49,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783182222] [2022-10-15 17:55:49,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:49,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:49,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:49,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:49,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783182222] [2022-10-15 17:55:49,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783182222] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:49,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:49,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:55:49,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681875983] [2022-10-15 17:55:49,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:49,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:55:49,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:49,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:55:49,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:55:49,455 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:55:49,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:49,535 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-10-15 17:55:49,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:55:49,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:55:49,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:49,539 INFO L225 Difference]: With dead ends: 33 [2022-10-15 17:55:49,539 INFO L226 Difference]: Without dead ends: 32 [2022-10-15 17:55:49,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:55:49,541 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:49,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:49,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-10-15 17:55:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-10-15 17:55:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-10-15 17:55:49,558 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 7 [2022-10-15 17:55:49,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:49,560 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-10-15 17:55:49,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:55:49,561 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-10-15 17:55:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 17:55:49,562 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:49,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:49,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:55:49,563 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-10-15 17:55:49,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:49,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1333227602, now seen corresponding path program 1 times [2022-10-15 17:55:49,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:49,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28601668] [2022-10-15 17:55:49,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:49,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:49,954 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:55:49,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:49,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28601668] [2022-10-15 17:55:49,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28601668] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:49,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:49,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:55:49,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15211309] [2022-10-15 17:55:49,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:49,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:55:49,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:49,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:55:49,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:55:49,960 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:55:50,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:50,040 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-10-15 17:55:50,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:55:50,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2022-10-15 17:55:50,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:50,046 INFO L225 Difference]: With dead ends: 49 [2022-10-15 17:55:50,047 INFO L226 Difference]: Without dead ends: 49 [2022-10-15 17:55:50,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:55:50,054 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:50,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 69 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:50,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-10-15 17:55:50,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2022-10-15 17:55:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.64) internal successors, (41), 33 states have internal predecessors, (41), 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:55:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-10-15 17:55:50,075 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 10 [2022-10-15 17:55:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:50,076 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-10-15 17:55:50,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:55:50,078 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-10-15 17:55:50,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 17:55:50,079 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:50,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:50,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 17:55:50,081 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-10-15 17:55:50,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:50,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1333227601, now seen corresponding path program 1 times [2022-10-15 17:55:50,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:50,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630018869] [2022-10-15 17:55:50,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:50,320 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:55:50,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:50,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630018869] [2022-10-15 17:55:50,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630018869] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:50,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:50,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:55:50,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575836090] [2022-10-15 17:55:50,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:50,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:55:50,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:50,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:55:50,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:55:50,330 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:55:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:50,404 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-10-15 17:55:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:55:50,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2022-10-15 17:55:50,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:50,405 INFO L225 Difference]: With dead ends: 33 [2022-10-15 17:55:50,405 INFO L226 Difference]: Without dead ends: 33 [2022-10-15 17:55:50,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:55:50,407 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 30 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:50,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 44 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:50,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-10-15 17:55:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-10-15 17:55:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.56) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-10-15 17:55:50,420 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 10 [2022-10-15 17:55:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:50,420 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-10-15 17:55:50,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:55:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-10-15 17:55:50,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 17:55:50,423 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:50,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:50,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 17:55:50,423 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-10-15 17:55:50,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:50,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1618786096, now seen corresponding path program 1 times [2022-10-15 17:55:50,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:50,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640892797] [2022-10-15 17:55:50,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:50,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:50,605 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:55:50,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:50,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640892797] [2022-10-15 17:55:50,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640892797] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:50,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:50,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:55:50,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402356786] [2022-10-15 17:55:50,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:50,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:55:50,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:50,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:55:50,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:55:50,608 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:50,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:50,650 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-10-15 17:55:50,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:55:50,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-15 17:55:50,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:50,652 INFO L225 Difference]: With dead ends: 32 [2022-10-15 17:55:50,652 INFO L226 Difference]: Without dead ends: 32 [2022-10-15 17:55:50,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:55:50,654 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 50 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:50,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 26 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:50,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-10-15 17:55:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-10-15 17:55:50,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.52) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:50,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-10-15 17:55:50,659 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2022-10-15 17:55:50,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:50,660 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-10-15 17:55:50,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:50,660 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-10-15 17:55:50,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 17:55:50,661 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:50,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:50,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 17:55:50,662 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-10-15 17:55:50,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:50,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1618786095, now seen corresponding path program 1 times [2022-10-15 17:55:50,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:50,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961502313] [2022-10-15 17:55:50,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:50,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:50,884 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:55:50,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:50,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961502313] [2022-10-15 17:55:50,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961502313] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:50,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:50,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:55:50,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112937824] [2022-10-15 17:55:50,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:50,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:55:50,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:50,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:55:50,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:55:50,887 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:50,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:50,963 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-10-15 17:55:50,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:55:50,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-15 17:55:50,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:50,965 INFO L225 Difference]: With dead ends: 44 [2022-10-15 17:55:50,965 INFO L226 Difference]: Without dead ends: 44 [2022-10-15 17:55:50,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:55:50,966 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 97 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:50,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 40 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:50,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-10-15 17:55:50,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2022-10-15 17:55:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 34 states have internal predecessors, (43), 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:55:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-10-15 17:55:50,972 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 11 [2022-10-15 17:55:50,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:50,973 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-10-15 17:55:50,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:50,973 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-10-15 17:55:50,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 17:55:50,974 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:50,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:50,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 17:55:50,975 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-10-15 17:55:50,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:50,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1619617326, now seen corresponding path program 1 times [2022-10-15 17:55:50,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:50,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057169513] [2022-10-15 17:55:50,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:50,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:51,132 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:55:51,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:51,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057169513] [2022-10-15 17:55:51,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057169513] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:51,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:51,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:55:51,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370462326] [2022-10-15 17:55:51,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:51,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:55:51,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:51,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:55:51,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:55:51,136 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:51,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:51,205 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-10-15 17:55:51,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:55:51,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-15 17:55:51,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:51,208 INFO L225 Difference]: With dead ends: 34 [2022-10-15 17:55:51,208 INFO L226 Difference]: Without dead ends: 34 [2022-10-15 17:55:51,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:55:51,209 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 53 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:51,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 42 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:51,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-10-15 17:55:51,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-10-15 17:55:51,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.5) internal successors, (42), 33 states have internal predecessors, (42), 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:55:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-10-15 17:55:51,215 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 11 [2022-10-15 17:55:51,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:51,216 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-10-15 17:55:51,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:51,216 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-10-15 17:55:51,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 17:55:51,217 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:51,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:51,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 17:55:51,218 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-10-15 17:55:51,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:51,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1619617325, now seen corresponding path program 1 times [2022-10-15 17:55:51,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:51,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393907816] [2022-10-15 17:55:51,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:51,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:51,478 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:55:51,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:51,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393907816] [2022-10-15 17:55:51,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393907816] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:51,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:51,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:55:51,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381731407] [2022-10-15 17:55:51,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:51,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:55:51,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:51,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:55:51,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:55:51,482 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:51,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:51,593 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-10-15 17:55:51,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 17:55:51,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-15 17:55:51,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:51,595 INFO L225 Difference]: With dead ends: 45 [2022-10-15 17:55:51,595 INFO L226 Difference]: Without dead ends: 45 [2022-10-15 17:55:51,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:55:51,596 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 106 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:51,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 59 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:51,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-10-15 17:55:51,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2022-10-15 17:55:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 34 states have internal predecessors, (43), 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:55:51,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-10-15 17:55:51,601 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 11 [2022-10-15 17:55:51,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:51,602 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-10-15 17:55:51,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:51,602 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-10-15 17:55:51,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 17:55:51,603 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:51,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:51,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 17:55:51,603 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-10-15 17:55:51,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:51,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1358038030, now seen corresponding path program 1 times [2022-10-15 17:55:51,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:51,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385756840] [2022-10-15 17:55:51,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:51,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:51,870 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:55:51,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:51,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385756840] [2022-10-15 17:55:51,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385756840] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:51,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:51,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:55:51,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135476077] [2022-10-15 17:55:51,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:51,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:55:51,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:51,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:55:51,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:55:51,874 INFO L87 Difference]: Start difference. First operand 35 states and 43 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:55:51,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:51,912 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-10-15 17:55:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:55:51,912 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:55:51,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:51,913 INFO L225 Difference]: With dead ends: 34 [2022-10-15 17:55:51,913 INFO L226 Difference]: Without dead ends: 31 [2022-10-15 17:55:51,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:55:51,914 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:51,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 71 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-10-15 17:55:51,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-10-15 17:55:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-10-15 17:55:51,919 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 12 [2022-10-15 17:55:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:51,919 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-10-15 17:55:51,919 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:55:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-10-15 17:55:51,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 17:55:51,920 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:51,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:51,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 17:55:51,921 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-10-15 17:55:51,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:51,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1357243700, now seen corresponding path program 1 times [2022-10-15 17:55:51,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:51,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845142132] [2022-10-15 17:55:51,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:51,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:52,009 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:55:52,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:52,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845142132] [2022-10-15 17:55:52,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845142132] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:52,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:52,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:55:52,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162842899] [2022-10-15 17:55:52,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:52,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:55:52,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:52,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:55:52,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:55:52,012 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:52,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:52,043 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-10-15 17:55:52,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:55:52,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 17:55:52,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:52,044 INFO L225 Difference]: With dead ends: 30 [2022-10-15 17:55:52,044 INFO L226 Difference]: Without dead ends: 30 [2022-10-15 17:55:52,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:55:52,045 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:52,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 39 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-10-15 17:55:52,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-10-15 17:55:52,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:52,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-10-15 17:55:52,050 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 12 [2022-10-15 17:55:52,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:52,050 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-10-15 17:55:52,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:52,050 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-10-15 17:55:52,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 17:55:52,051 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:52,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:52,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 17:55:52,052 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-10-15 17:55:52,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:52,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1357243701, now seen corresponding path program 1 times [2022-10-15 17:55:52,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:52,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361187871] [2022-10-15 17:55:52,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:52,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:52,310 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:55:52,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:52,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361187871] [2022-10-15 17:55:52,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361187871] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:52,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:52,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:55:52,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177370326] [2022-10-15 17:55:52,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:52,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:55:52,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:52,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:55:52,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:55:52,313 INFO L87 Difference]: Start difference. First operand 30 states and 36 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:55:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:52,403 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-10-15 17:55:52,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:55:52,404 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:55:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:52,404 INFO L225 Difference]: With dead ends: 39 [2022-10-15 17:55:52,404 INFO L226 Difference]: Without dead ends: 39 [2022-10-15 17:55:52,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:55:52,406 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:52,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 70 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:52,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-10-15 17:55:52,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2022-10-15 17:55:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-10-15 17:55:52,410 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 12 [2022-10-15 17:55:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:52,410 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-10-15 17:55:52,411 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:55:52,411 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-10-15 17:55:52,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 17:55:52,411 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:52,412 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:52,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 17:55:52,412 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-10-15 17:55:52,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:52,413 INFO L85 PathProgramCache]: Analyzing trace with hash 824988573, now seen corresponding path program 1 times [2022-10-15 17:55:52,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:52,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252239081] [2022-10-15 17:55:52,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:52,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:52,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 17:55:52,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:52,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252239081] [2022-10-15 17:55:52,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252239081] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:52,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:52,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:55:52,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112365219] [2022-10-15 17:55:52,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:52,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:55:52,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:52,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:55:52,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:55:52,564 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:52,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:52,618 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2022-10-15 17:55:52,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:55:52,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 17:55:52,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:52,620 INFO L225 Difference]: With dead ends: 54 [2022-10-15 17:55:52,620 INFO L226 Difference]: Without dead ends: 54 [2022-10-15 17:55:52,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:55:52,621 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 32 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:52,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 75 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:52,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-15 17:55:52,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 35. [2022-10-15 17:55:52,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 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:55:52,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-10-15 17:55:52,628 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 15 [2022-10-15 17:55:52,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:52,629 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-10-15 17:55:52,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:52,629 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-10-15 17:55:52,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 17:55:52,630 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:52,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:52,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 17:55:52,630 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-10-15 17:55:52,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:52,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1813342470, now seen corresponding path program 1 times [2022-10-15 17:55:52,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:52,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40150203] [2022-10-15 17:55:52,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:52,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:52,764 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:55:52,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:52,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40150203] [2022-10-15 17:55:52,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40150203] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:52,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:52,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:55:52,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017152885] [2022-10-15 17:55:52,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:52,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:55:52,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:52,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:55:52,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:55:52,767 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:55:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:52,783 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-10-15 17:55:52,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:55:52,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:55:52,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:52,784 INFO L225 Difference]: With dead ends: 38 [2022-10-15 17:55:52,784 INFO L226 Difference]: Without dead ends: 37 [2022-10-15 17:55:52,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:55:52,785 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:52,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 46 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:52,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-10-15 17:55:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-10-15 17:55:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.3125) internal successors, (42), 35 states have internal predecessors, (42), 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:55:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-10-15 17:55:52,789 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 15 [2022-10-15 17:55:52,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:52,789 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-10-15 17:55:52,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:55:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-10-15 17:55:52,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 17:55:52,790 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:52,791 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:52,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 17:55:52,791 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-10-15 17:55:52,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:52,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1505046943, now seen corresponding path program 1 times [2022-10-15 17:55:52,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:52,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677857017] [2022-10-15 17:55:52,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:52,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:53,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:53,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:53,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677857017] [2022-10-15 17:55:53,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677857017] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:55:53,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922210859] [2022-10-15 17:55:53,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:53,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:53,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:53,167 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:55:53,171 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:55:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:53,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-15 17:55:53,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:55:53,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 17:55:53,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:55:53,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922210859] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:53,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:55:53,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-10-15 17:55:53,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762780187] [2022-10-15 17:55:53,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:53,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:55:53,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:53,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:55:53,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:55:53,402 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:53,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:53,427 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-10-15 17:55:53,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:55:53,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 17:55:53,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:53,428 INFO L225 Difference]: With dead ends: 40 [2022-10-15 17:55:53,428 INFO L226 Difference]: Without dead ends: 39 [2022-10-15 17:55:53,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-10-15 17:55:53,430 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 27 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:53,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 58 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:53,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-10-15 17:55:53,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2022-10-15 17:55:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-10-15 17:55:53,440 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 15 [2022-10-15 17:55:53,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:53,440 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-10-15 17:55:53,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:53,441 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-10-15 17:55:53,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 17:55:53,442 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:53,442 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:53,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 17:55:53,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-15 17:55:53,656 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-10-15 17:55:53,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:53,656 INFO L85 PathProgramCache]: Analyzing trace with hash -596495872, now seen corresponding path program 1 times [2022-10-15 17:55:53,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:53,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883337817] [2022-10-15 17:55:53,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:53,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:55:53,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 17:55:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:55:53,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 17:55:53,764 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 17:55:53,766 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 11 remaining) [2022-10-15 17:55:53,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2022-10-15 17:55:53,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2022-10-15 17:55:53,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 11 remaining) [2022-10-15 17:55:53,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 11 remaining) [2022-10-15 17:55:53,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2022-10-15 17:55:53,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2022-10-15 17:55:53,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 11 remaining) [2022-10-15 17:55:53,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2022-10-15 17:55:53,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 11 remaining) [2022-10-15 17:55:53,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (0 of 11 remaining) [2022-10-15 17:55:53,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-15 17:55:53,781 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:53,790 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:55:53,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:55:53 BoogieIcfgContainer [2022-10-15 17:55:53,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:55:53,870 INFO L158 Benchmark]: Toolchain (without parser) took 7199.39ms. Allocated memory was 151.0MB in the beginning and 185.6MB in the end (delta: 34.6MB). Free memory was 125.0MB in the beginning and 131.9MB in the end (delta: -6.9MB). Peak memory consumption was 28.8MB. Max. memory is 8.0GB. [2022-10-15 17:55:53,870 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 151.0MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:55:53,871 INFO L158 Benchmark]: CACSL2BoogieTranslator took 786.05ms. Allocated memory is still 151.0MB. Free memory was 124.8MB in the beginning and 109.4MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-10-15 17:55:53,871 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.62ms. Allocated memory is still 151.0MB. Free memory was 109.2MB in the beginning and 107.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:55:53,871 INFO L158 Benchmark]: Boogie Preprocessor took 33.89ms. Allocated memory is still 151.0MB. Free memory was 107.4MB in the beginning and 106.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:55:53,872 INFO L158 Benchmark]: RCFGBuilder took 600.62ms. Allocated memory is still 151.0MB. Free memory was 105.8MB in the beginning and 125.3MB in the end (delta: -19.6MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-10-15 17:55:53,872 INFO L158 Benchmark]: TraceAbstraction took 5682.19ms. Allocated memory was 151.0MB in the beginning and 185.6MB in the end (delta: 34.6MB). Free memory was 124.8MB in the beginning and 131.9MB in the end (delta: -7.1MB). Peak memory consumption was 29.1MB. Max. memory is 8.0GB. [2022-10-15 17:55:53,874 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.30ms. Allocated memory is still 151.0MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 786.05ms. Allocated memory is still 151.0MB. Free memory was 124.8MB in the beginning and 109.4MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.62ms. Allocated memory is still 151.0MB. Free memory was 109.2MB in the beginning and 107.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.89ms. Allocated memory is still 151.0MB. Free memory was 107.4MB in the beginning and 106.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 600.62ms. Allocated memory is still 151.0MB. Free memory was 105.8MB in the beginning and 125.3MB in the end (delta: -19.6MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * TraceAbstraction took 5682.19ms. Allocated memory was 151.0MB in the beginning and 185.6MB in the end (delta: 34.6MB). Free memory was 124.8MB in the beginning and 131.9MB in the end (delta: -7.1MB). Peak memory consumption was 29.1MB. 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 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L529] int in_len = __VERIFIER_nondet_int(); [L530] COND FALSE !(in_len < 1) [L531] char* in = __builtin_alloca (in_len); VAL [__builtin_alloca (in_len)={4:0}, in={4:0}, in_len=6] [L532] in[in_len-1]=0 VAL [__builtin_alloca (in_len)={4:0}, in={4:0}, in_len=6] [L533] int out_len = __VERIFIER_nondet_int(); [L534] COND FALSE !(out_len < 1) [L535] char* out = __builtin_alloca (out_len); [L536] CALL strlcpy(in, out, out_len) [L511] register char *d = dst; [L512] register const char *s = src; [L513] register size_t n = siz; [L514] n != 0 && --n != 0 [L514] EXPR --n [L514] n != 0 && --n != 0 VAL [--n=0, \old(siz)=1, d={4:0}, dst={4:0}, dst={4:0}, n=0, n != 0 && --n != 0=0, s={3:0}, siz=1, src={3:0}, src={3:0}] [L514] COND FALSE !(n != 0 && --n != 0) [L520] COND TRUE n == 0 VAL [\old(siz)=1, d={4:0}, dst={4:0}, dst={4:0}, n=0, s={3:0}, siz=1, src={3:0}, src={3:0}] [L521] COND TRUE siz != 0 VAL [\old(siz)=1, d={4:0}, dst={4:0}, dst={4:0}, n=0, s={3:0}, siz=1, src={3:0}, src={3:0}] [L522] *d = '\0' VAL [\old(siz)=1, d={4:0}, dst={4:0}, dst={4:0}, n=0, s={3:0}, siz=1, src={3:0}, src={3:0}] [L523] EXPR s++ VAL [\old(siz)=1, d={4:0}, dst={4:0}, dst={4:0}, n=0, s={3:1}, s++=7, s++={3:0}, siz=1, src={3:0}, src={3:0}] [L523] COND TRUE *s++ - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 528]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 516 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 516 mSDsluCounter, 874 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 417 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 459 IncrementalHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 457 mSDtfsCounter, 459 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 70, 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, 16 MinimizatonAttempts, 68 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 879 SizeOfPredicates, 4 NumberOfNonLiveVariables, 119 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 4/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-10-15 17:55:53,925 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...