/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:57:09,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:57:09,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:57:09,427 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:57:09,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:57:09,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:57:09,443 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:57:09,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:57:09,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:57:09,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:57:09,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:57:09,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:57:09,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:57:09,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:57:09,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:57:09,472 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:57:09,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:57:09,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:57:09,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:57:09,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:57:09,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:57:09,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:57:09,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:57:09,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:57:09,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:57:09,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:57:09,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:57:09,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:57:09,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:57:09,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:57:09,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:57:09,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:57:09,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:57:09,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:57:09,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:57:09,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:57:09,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:57:09,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:57:09,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:57:09,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:57:09,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:57:09,504 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:57:09,534 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:57:09,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:57:09,534 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:57:09,535 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:57:09,535 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:57:09,536 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:57:09,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:57:09,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:57:09,537 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:57:09,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:57:09,537 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:57:09,538 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:57:09,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:57:09,538 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:57:09,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:57:09,538 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:57:09,539 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:57:09,539 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:57:09,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:57:09,539 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:57:09,539 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:57:09,540 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:57:09,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:57:09,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:57:09,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:57:09,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:57:09,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:57:09,541 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:57:09,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:57:09,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:57:09,542 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:57:09,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:57:09,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:57:09,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:57:09,991 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:57:09,992 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:57:09,994 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i [2022-10-15 17:57:10,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57fe76adf/68c7f5f6e1274f879c6cd69c0efa46ca/FLAGc2bea28cc [2022-10-15 17:57:10,861 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:57:10,862 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i [2022-10-15 17:57:10,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57fe76adf/68c7f5f6e1274f879c6cd69c0efa46ca/FLAGc2bea28cc [2022-10-15 17:57:11,162 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57fe76adf/68c7f5f6e1274f879c6cd69c0efa46ca [2022-10-15 17:57:11,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:57:11,172 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:57:11,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:57:11,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:57:11,190 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:57:11,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:57:11" (1/1) ... [2022-10-15 17:57:11,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e147da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:11, skipping insertion in model container [2022-10-15 17:57:11,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:57:11" (1/1) ... [2022-10-15 17:57:11,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:57:11,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:57:11,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:57:11,669 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:57:11,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:57:11,808 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:57:11,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:11 WrapperNode [2022-10-15 17:57:11,808 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:57:11,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:57:11,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:57:11,810 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:57:11,821 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:57:11" (1/1) ... [2022-10-15 17:57:11,856 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:57:11" (1/1) ... [2022-10-15 17:57:11,898 INFO L138 Inliner]: procedures = 111, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2022-10-15 17:57:11,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:57:11,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:57:11,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:57:11,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:57:11,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:11" (1/1) ... [2022-10-15 17:57:11,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:11" (1/1) ... [2022-10-15 17:57:11,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:11" (1/1) ... [2022-10-15 17:57:11,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:11" (1/1) ... [2022-10-15 17:57:11,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:11" (1/1) ... [2022-10-15 17:57:11,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:11" (1/1) ... [2022-10-15 17:57:11,926 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:11" (1/1) ... [2022-10-15 17:57:11,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:11" (1/1) ... [2022-10-15 17:57:11,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:57:11,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:57:11,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:57:11,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:57:11,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:11" (1/1) ... [2022-10-15 17:57:11,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:57:11,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:57:11,968 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:57:11,988 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:57:12,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 17:57:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 17:57:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 17:57:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 17:57:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:57:12,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:57:12,155 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:57:12,158 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:57:12,658 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:57:12,670 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:57:12,670 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-15 17:57:12,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:57:12 BoogieIcfgContainer [2022-10-15 17:57:12,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:57:12,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:57:12,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:57:12,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:57:12,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:57:11" (1/3) ... [2022-10-15 17:57:12,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac5da83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:57:12, skipping insertion in model container [2022-10-15 17:57:12,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:11" (2/3) ... [2022-10-15 17:57:12,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ac5da83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:57:12, skipping insertion in model container [2022-10-15 17:57:12,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:57:12" (3/3) ... [2022-10-15 17:57:12,686 INFO L112 eAbstractionObserver]: Analyzing ICFG b.12-alloca.i [2022-10-15 17:57:12,709 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:57:12,709 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-10-15 17:57:12,795 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:57:12,808 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;@644c15fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:57:12,808 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-10-15 17:57:12,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 51 states have internal predecessors, (56), 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:57:12,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 17:57:12,822 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:12,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 17:57:12,823 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:57:12,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:12,830 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-10-15 17:57:12,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:12,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785677459] [2022-10-15 17:57:12,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:12,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:13,494 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:57:13,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:13,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785677459] [2022-10-15 17:57:13,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785677459] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:13,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:13,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:57:13,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697771254] [2022-10-15 17:57:13,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:13,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:57:13,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:13,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:57:13,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:13,544 INFO L87 Difference]: Start difference. First operand has 52 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 51 states have internal predecessors, (56), 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 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:13,638 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-10-15 17:57:13,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:57:13,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-10-15 17:57:13,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:13,652 INFO L225 Difference]: With dead ends: 47 [2022-10-15 17:57:13,653 INFO L226 Difference]: Without dead ends: 45 [2022-10-15 17:57:13,655 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:57:13,660 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 43 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:13,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 27 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:57:13,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-10-15 17:57:13,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-10-15 17:57:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.92) internal successors, (48), 44 states have internal predecessors, (48), 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:57:13,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-10-15 17:57:13,704 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 3 [2022-10-15 17:57:13,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:13,704 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-10-15 17:57:13,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:13,705 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-10-15 17:57:13,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 17:57:13,705 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:13,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 17:57:13,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:57:13,706 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:57:13,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:13,707 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-10-15 17:57:13,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:13,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638477166] [2022-10-15 17:57:13,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:13,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:13,950 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:57:13,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:13,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638477166] [2022-10-15 17:57:13,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638477166] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:13,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:13,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:57:13,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936071864] [2022-10-15 17:57:13,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:13,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:57:13,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:13,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:57:13,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:13,958 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:14,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:14,050 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-10-15 17:57:14,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:57:14,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-10-15 17:57:14,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:14,055 INFO L225 Difference]: With dead ends: 40 [2022-10-15 17:57:14,055 INFO L226 Difference]: Without dead ends: 40 [2022-10-15 17:57:14,056 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:57:14,060 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:14,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 25 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:57:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-10-15 17:57:14,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-10-15 17:57:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.72) internal successors, (43), 39 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:57:14,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-10-15 17:57:14,080 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 3 [2022-10-15 17:57:14,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:14,081 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-10-15 17:57:14,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-10-15 17:57:14,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:57:14,082 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:14,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:57:14,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:57:14,085 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:57:14,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:14,087 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2022-10-15 17:57:14,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:14,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289247042] [2022-10-15 17:57:14,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:14,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:14,316 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:57:14,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:14,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289247042] [2022-10-15 17:57:14,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289247042] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:14,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:14,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:57:14,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378265396] [2022-10-15 17:57:14,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:14,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:57:14,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:14,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:57:14,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:14,329 INFO L87 Difference]: Start difference. First operand 40 states and 43 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:57:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:14,412 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-10-15 17:57:14,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:57:14,413 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:57:14,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:14,417 INFO L225 Difference]: With dead ends: 35 [2022-10-15 17:57:14,417 INFO L226 Difference]: Without dead ends: 35 [2022-10-15 17:57:14,418 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:57:14,426 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:14,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 19 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:57:14,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-10-15 17:57:14,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-10-15 17:57:14,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.52) internal successors, (38), 34 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:57:14,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-10-15 17:57:14,441 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 4 [2022-10-15 17:57:14,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:14,442 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-10-15 17:57:14,442 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:57:14,442 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-10-15 17:57:14,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:57:14,443 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:14,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:57:14,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:57:14,444 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:57:14,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:14,446 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2022-10-15 17:57:14,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:14,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360072633] [2022-10-15 17:57:14,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:14,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:14,641 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:57:14,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:14,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360072633] [2022-10-15 17:57:14,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360072633] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:14,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:14,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:57:14,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208541564] [2022-10-15 17:57:14,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:14,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:57:14,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:14,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:57:14,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:14,645 INFO L87 Difference]: Start difference. First operand 35 states and 38 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:57:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:14,677 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-10-15 17:57:14,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:57:14,678 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:57:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:14,679 INFO L225 Difference]: With dead ends: 30 [2022-10-15 17:57:14,679 INFO L226 Difference]: Without dead ends: 30 [2022-10-15 17:57:14,679 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:57:14,681 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:14,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 20 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:14,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-10-15 17:57:14,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-10-15 17:57:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-10-15 17:57:14,687 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 4 [2022-10-15 17:57:14,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:14,687 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-10-15 17:57:14,688 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:57:14,688 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-10-15 17:57:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 17:57:14,688 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:14,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 17:57:14,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:57:14,689 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:57:14,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:14,690 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2022-10-15 17:57:14,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:14,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922071608] [2022-10-15 17:57:14,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:14,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:14,773 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:57:14,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:14,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922071608] [2022-10-15 17:57:14,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922071608] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:14,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:14,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:57:14,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183650145] [2022-10-15 17:57:14,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:14,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:57:14,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:14,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:57:14,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:14,777 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:14,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:14,808 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-10-15 17:57:14,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:57:14,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 17:57:14,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:14,809 INFO L225 Difference]: With dead ends: 28 [2022-10-15 17:57:14,810 INFO L226 Difference]: Without dead ends: 28 [2022-10-15 17:57:14,810 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:57:14,812 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 17 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:57:14,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 17 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:14,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-10-15 17:57:14,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-10-15 17:57:14,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 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:57:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-10-15 17:57:14,817 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 5 [2022-10-15 17:57:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:14,817 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-10-15 17:57:14,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-10-15 17:57:14,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 17:57:14,819 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:14,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 17:57:14,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 17:57:14,819 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:57:14,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:14,820 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2022-10-15 17:57:14,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:14,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072570321] [2022-10-15 17:57:14,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:14,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:14,909 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:57:14,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:14,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072570321] [2022-10-15 17:57:14,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072570321] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:14,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:14,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:57:14,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32788715] [2022-10-15 17:57:14,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:14,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:57:14,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:14,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:57:14,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:14,913 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:14,937 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-10-15 17:57:14,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:57:14,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 17:57:14,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:14,939 INFO L225 Difference]: With dead ends: 26 [2022-10-15 17:57:14,939 INFO L226 Difference]: Without dead ends: 26 [2022-10-15 17:57:14,939 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:57:14,941 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:14,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 18 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:14,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-10-15 17:57:14,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-10-15 17:57:14,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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:57:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-10-15 17:57:14,946 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 5 [2022-10-15 17:57:14,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:14,946 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-10-15 17:57:14,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:14,947 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-10-15 17:57:14,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 17:57:14,948 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:14,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:14,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 17:57:14,948 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:57:14,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:14,949 INFO L85 PathProgramCache]: Analyzing trace with hash 849801493, now seen corresponding path program 1 times [2022-10-15 17:57:14,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:14,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515254976] [2022-10-15 17:57:14,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:14,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:14,987 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:57:14,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:14,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515254976] [2022-10-15 17:57:14,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515254976] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:14,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:14,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:57:14,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889905129] [2022-10-15 17:57:14,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:14,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:57:14,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:14,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:57:14,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:14,991 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:15,004 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-10-15 17:57:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:57:15,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-15 17:57:15,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:15,005 INFO L225 Difference]: With dead ends: 27 [2022-10-15 17:57:15,005 INFO L226 Difference]: Without dead ends: 27 [2022-10-15 17:57:15,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:57:15,007 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:15,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-10-15 17:57:15,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-10-15 17:57:15,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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:57:15,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-10-15 17:57:15,012 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 13 [2022-10-15 17:57:15,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:15,013 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-10-15 17:57:15,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-10-15 17:57:15,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 17:57:15,014 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:15,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:15,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 17:57:15,015 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:57:15,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:15,016 INFO L85 PathProgramCache]: Analyzing trace with hash 972624272, now seen corresponding path program 1 times [2022-10-15 17:57:15,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:15,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186311433] [2022-10-15 17:57:15,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:15,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:15,463 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:57:15,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:15,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186311433] [2022-10-15 17:57:15,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186311433] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:15,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:15,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:57:15,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636943929] [2022-10-15 17:57:15,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:15,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:57:15,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:15,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:57:15,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:57:15,467 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 4 states, 3 states have (on average 5.0) 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:57:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:15,511 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-10-15 17:57:15,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:57:15,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) 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:57:15,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:15,512 INFO L225 Difference]: With dead ends: 26 [2022-10-15 17:57:15,513 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 17:57:15,513 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:57:15,515 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:15,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 28 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:15,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 17:57:15,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 17:57:15,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:57:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 17:57:15,517 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-10-15 17:57:15,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:15,518 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 17:57:15,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) 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:57:15,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 17:57:15,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 17:57:15,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 25 remaining) [2022-10-15 17:57:15,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 25 remaining) [2022-10-15 17:57:15,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 25 remaining) [2022-10-15 17:57:15,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 25 remaining) [2022-10-15 17:57:15,531 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 25 remaining) [2022-10-15 17:57:15,532 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 25 remaining) [2022-10-15 17:57:15,534 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 25 remaining) [2022-10-15 17:57:15,535 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 25 remaining) [2022-10-15 17:57:15,536 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 25 remaining) [2022-10-15 17:57:15,536 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 25 remaining) [2022-10-15 17:57:15,536 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 25 remaining) [2022-10-15 17:57:15,537 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 25 remaining) [2022-10-15 17:57:15,537 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 25 remaining) [2022-10-15 17:57:15,537 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 25 remaining) [2022-10-15 17:57:15,537 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 25 remaining) [2022-10-15 17:57:15,538 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 25 remaining) [2022-10-15 17:57:15,538 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 25 remaining) [2022-10-15 17:57:15,538 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 25 remaining) [2022-10-15 17:57:15,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 25 remaining) [2022-10-15 17:57:15,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 25 remaining) [2022-10-15 17:57:15,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 25 remaining) [2022-10-15 17:57:15,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 25 remaining) [2022-10-15 17:57:15,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 25 remaining) [2022-10-15 17:57:15,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 25 remaining) [2022-10-15 17:57:15,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (0 of 25 remaining) [2022-10-15 17:57:15,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 17:57:15,545 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:15,550 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:57:15,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:57:15 BoogieIcfgContainer [2022-10-15 17:57:15,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:57:15,558 INFO L158 Benchmark]: Toolchain (without parser) took 4390.96ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 123.8MB in the beginning and 144.7MB in the end (delta: -20.9MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-10-15 17:57:15,559 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 151.0MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:57:15,559 INFO L158 Benchmark]: CACSL2BoogieTranslator took 629.47ms. Allocated memory is still 151.0MB. Free memory was 123.5MB in the beginning and 108.3MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-10-15 17:57:15,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.93ms. Allocated memory is still 151.0MB. Free memory was 108.3MB in the beginning and 106.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:57:15,560 INFO L158 Benchmark]: Boogie Preprocessor took 30.17ms. Allocated memory is still 151.0MB. Free memory was 106.4MB in the beginning and 105.2MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:57:15,561 INFO L158 Benchmark]: RCFGBuilder took 743.94ms. Allocated memory is still 151.0MB. Free memory was 105.1MB in the beginning and 127.4MB in the end (delta: -22.3MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. [2022-10-15 17:57:15,561 INFO L158 Benchmark]: TraceAbstraction took 2879.86ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 126.9MB in the beginning and 144.7MB in the end (delta: -17.8MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. [2022-10-15 17:57:15,565 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.33ms. Allocated memory is still 151.0MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 629.47ms. Allocated memory is still 151.0MB. Free memory was 123.5MB in the beginning and 108.3MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 88.93ms. Allocated memory is still 151.0MB. Free memory was 108.3MB in the beginning and 106.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.17ms. Allocated memory is still 151.0MB. Free memory was 106.4MB in the beginning and 105.2MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 743.94ms. Allocated memory is still 151.0MB. Free memory was 105.1MB in the beginning and 127.4MB in the end (delta: -22.3MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. * TraceAbstraction took 2879.86ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 126.9MB in the beginning and 144.7MB in the end (delta: -17.8MB). Peak memory consumption was 14.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 209 mSDsluCounter, 204 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 151 IncrementalHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 162 mSDtfsCounter, 151 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 384 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 25 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-10-15 17:57:15,647 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...