/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-15/cstrpbrk_reverse_alloca.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:53:45,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:53:45,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:53:45,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:53:45,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:53:45,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:53:45,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:53:45,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:53:45,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:53:45,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:53:45,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:53:45,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:53:45,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:53:45,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:53:45,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:53:45,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:53:45,553 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:53:45,554 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:53:45,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:53:45,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:53:45,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:53:45,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:53:45,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:53:45,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:53:45,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:53:45,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:53:45,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:53:45,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:53:45,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:53:45,575 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:53:45,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:53:45,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:53:45,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:53:45,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:53:45,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:53:45,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:53:45,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:53:45,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:53:45,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:53:45,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:53:45,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:53:45,585 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:53:45,614 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:53:45,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:53:45,615 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:53:45,615 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:53:45,616 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:53:45,616 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:53:45,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:53:45,617 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:53:45,617 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:53:45,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:53:45,618 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:53:45,618 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:53:45,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:53:45,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:53:45,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:53:45,619 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:53:45,619 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:53:45,619 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:53:45,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:53:45,620 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:53:45,620 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:53:45,620 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:53:45,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:53:45,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:53:45,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:53:45,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:53:45,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:53:45,622 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:53:45,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:53:45,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:53:45,623 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:53:45,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:53:46,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:53:46,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:53:46,037 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:53:46,038 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:53:46,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca.i [2022-10-15 17:53:46,136 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa21809c7/fb05eb009af6422fa7b143b58d839bae/FLAG928b1c81a [2022-10-15 17:53:46,815 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:53:46,816 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrpbrk_reverse_alloca.i [2022-10-15 17:53:46,829 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa21809c7/fb05eb009af6422fa7b143b58d839bae/FLAG928b1c81a [2022-10-15 17:53:47,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa21809c7/fb05eb009af6422fa7b143b58d839bae [2022-10-15 17:53:47,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:53:47,138 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:53:47,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:53:47,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:53:47,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:53:47,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:53:47" (1/1) ... [2022-10-15 17:53:47,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@542d21dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:47, skipping insertion in model container [2022-10-15 17:53:47,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:53:47" (1/1) ... [2022-10-15 17:53:47,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:53:47,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:53:47,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:53:47,677 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:53:47,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:53:47,797 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:53:47,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:47 WrapperNode [2022-10-15 17:53:47,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:53:47,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:53:47,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:53:47,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:53:47,811 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:53:47" (1/1) ... [2022-10-15 17:53:47,849 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:53:47" (1/1) ... [2022-10-15 17:53:47,877 INFO L138 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2022-10-15 17:53:47,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:53:47,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:53:47,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:53:47,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:53:47,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:47" (1/1) ... [2022-10-15 17:53:47,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:47" (1/1) ... [2022-10-15 17:53:47,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:47" (1/1) ... [2022-10-15 17:53:47,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:47" (1/1) ... [2022-10-15 17:53:47,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:47" (1/1) ... [2022-10-15 17:53:47,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:47" (1/1) ... [2022-10-15 17:53:47,907 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:47" (1/1) ... [2022-10-15 17:53:47,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:47" (1/1) ... [2022-10-15 17:53:47,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:53:47,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:53:47,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:53:47,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:53:47,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:47" (1/1) ... [2022-10-15 17:53:47,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:53:47,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:53:47,963 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:53:47,982 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:53:48,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 17:53:48,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 17:53:48,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 17:53:48,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 17:53:48,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:53:48,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:53:48,124 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:53:48,127 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:53:48,567 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:53:48,584 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:53:48,585 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 17:53:48,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:53:48 BoogieIcfgContainer [2022-10-15 17:53:48,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:53:48,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:53:48,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:53:48,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:53:48,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:53:47" (1/3) ... [2022-10-15 17:53:48,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de484d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:53:48, skipping insertion in model container [2022-10-15 17:53:48,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:47" (2/3) ... [2022-10-15 17:53:48,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de484d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:53:48, skipping insertion in model container [2022-10-15 17:53:48,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:53:48" (3/3) ... [2022-10-15 17:53:48,616 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrpbrk_reverse_alloca.i [2022-10-15 17:53:48,650 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:53:48,650 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2022-10-15 17:53:48,739 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:53:48,753 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;@434b916, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:53:48,753 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-10-15 17:53:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.92) internal successors, (48), 40 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:53:48,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 17:53:48,771 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:48,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 17:53:48,772 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:48,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:48,782 INFO L85 PathProgramCache]: Analyzing trace with hash 889510731, now seen corresponding path program 1 times [2022-10-15 17:53:48,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:48,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824479547] [2022-10-15 17:53:48,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:48,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:49,245 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:53:49,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:49,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824479547] [2022-10-15 17:53:49,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824479547] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:49,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:49,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:53:49,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53575533] [2022-10-15 17:53:49,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:49,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:53:49,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:49,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:53:49,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:53:49,318 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.92) internal successors, (48), 40 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) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:49,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:49,440 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-10-15 17:53:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:53:49,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-15 17:53:49,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:49,458 INFO L225 Difference]: With dead ends: 40 [2022-10-15 17:53:49,459 INFO L226 Difference]: Without dead ends: 38 [2022-10-15 17:53:49,462 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:53:49,469 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 33 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:49,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 34 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:53:49,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-10-15 17:53:49,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-10-15 17:53:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 37 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:53:49,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-10-15 17:53:49,525 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 6 [2022-10-15 17:53:49,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:49,525 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-10-15 17:53:49,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-10-15 17:53:49,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 17:53:49,526 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:49,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 17:53:49,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:53:49,528 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:49,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:49,529 INFO L85 PathProgramCache]: Analyzing trace with hash 889510732, now seen corresponding path program 1 times [2022-10-15 17:53:49,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:49,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591875410] [2022-10-15 17:53:49,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:49,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:49,917 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:53:49,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:49,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591875410] [2022-10-15 17:53:49,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591875410] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:49,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:49,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:53:49,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470501383] [2022-10-15 17:53:49,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:49,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:53:49,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:49,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:53:49,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:53:49,926 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:50,005 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-10-15 17:53:50,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:53:50,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-15 17:53:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:50,007 INFO L225 Difference]: With dead ends: 37 [2022-10-15 17:53:50,007 INFO L226 Difference]: Without dead ends: 37 [2022-10-15 17:53:50,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:53:50,010 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 40 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:50,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 64 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:50,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-10-15 17:53:50,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-10-15 17:53:50,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.75) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:50,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-10-15 17:53:50,018 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 6 [2022-10-15 17:53:50,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:50,018 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-10-15 17:53:50,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-10-15 17:53:50,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 17:53:50,019 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:50,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:50,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:53:50,020 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:50,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:50,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028874, now seen corresponding path program 1 times [2022-10-15 17:53:50,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:50,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765861326] [2022-10-15 17:53:50,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:50,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:50,070 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:53:50,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:50,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765861326] [2022-10-15 17:53:50,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765861326] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:50,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:50,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:53:50,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812918400] [2022-10-15 17:53:50,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:50,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:53:50,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:50,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:53:50,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:53:50,074 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:50,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:50,122 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-10-15 17:53:50,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:53:50,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-15 17:53:50,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:50,125 INFO L225 Difference]: With dead ends: 36 [2022-10-15 17:53:50,125 INFO L226 Difference]: Without dead ends: 36 [2022-10-15 17:53:50,125 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:53:50,130 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 30 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:50,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 30 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:50,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-15 17:53:50,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-10-15 17:53:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-10-15 17:53:50,145 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 7 [2022-10-15 17:53:50,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:50,146 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-10-15 17:53:50,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:50,146 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-10-15 17:53:50,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 17:53:50,148 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:50,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:50,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:53:50,149 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:50,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:50,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028875, now seen corresponding path program 1 times [2022-10-15 17:53:50,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:50,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516746466] [2022-10-15 17:53:50,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:50,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:50,315 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:53:50,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:50,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516746466] [2022-10-15 17:53:50,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516746466] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:50,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:50,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:53:50,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954383122] [2022-10-15 17:53:50,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:50,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:53:50,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:50,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:53:50,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:53:50,327 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:50,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:50,397 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-10-15 17:53:50,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:53:50,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-15 17:53:50,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:50,403 INFO L225 Difference]: With dead ends: 35 [2022-10-15 17:53:50,404 INFO L226 Difference]: Without dead ends: 35 [2022-10-15 17:53:50,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:53:50,412 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 34 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:50,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 64 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:50,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-10-15 17:53:50,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-10-15 17:53:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-10-15 17:53:50,424 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 7 [2022-10-15 17:53:50,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:50,424 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-10-15 17:53:50,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:50,426 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-10-15 17:53:50,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 17:53:50,426 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:50,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:50,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:53:50,427 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:50,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:50,429 INFO L85 PathProgramCache]: Analyzing trace with hash -534039922, now seen corresponding path program 1 times [2022-10-15 17:53:50,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:50,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335079245] [2022-10-15 17:53:50,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:50,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:50,579 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:53:50,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:50,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335079245] [2022-10-15 17:53:50,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335079245] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:50,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:50,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:53:50,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024357641] [2022-10-15 17:53:50,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:50,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:53:50,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:50,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:53:50,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:53:50,587 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:53:50,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:50,644 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-10-15 17:53:50,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:53:50,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-10-15 17:53:50,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:50,646 INFO L225 Difference]: With dead ends: 33 [2022-10-15 17:53:50,646 INFO L226 Difference]: Without dead ends: 33 [2022-10-15 17:53:50,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:53:50,648 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 50 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:50,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 30 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-10-15 17:53:50,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-10-15 17:53:50,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 32 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:53:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-10-15 17:53:50,653 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 9 [2022-10-15 17:53:50,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:50,654 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-10-15 17:53:50,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:53:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-10-15 17:53:50,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 17:53:50,655 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:50,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:50,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 17:53:50,656 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:50,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:50,656 INFO L85 PathProgramCache]: Analyzing trace with hash -534039921, now seen corresponding path program 1 times [2022-10-15 17:53:50,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:50,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267955225] [2022-10-15 17:53:50,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:50,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:50,849 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:53:50,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:50,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267955225] [2022-10-15 17:53:50,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267955225] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:50,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:50,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:53:50,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727261002] [2022-10-15 17:53:50,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:50,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:53:50,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:50,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:53:50,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:53:50,856 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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:53:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:50,977 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2022-10-15 17:53:50,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:53:50,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2022-10-15 17:53:50,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:50,979 INFO L225 Difference]: With dead ends: 62 [2022-10-15 17:53:50,979 INFO L226 Difference]: Without dead ends: 62 [2022-10-15 17:53:50,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:53:50,980 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 107 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:50,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 93 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:53:50,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-10-15 17:53:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 38. [2022-10-15 17:53:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 37 states have internal predecessors, (44), 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:53:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-10-15 17:53:50,987 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 9 [2022-10-15 17:53:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:50,988 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-10-15 17:53:50,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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:53:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-10-15 17:53:50,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 17:53:50,989 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:50,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:50,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 17:53:50,989 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:50,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:50,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1240967441, now seen corresponding path program 1 times [2022-10-15 17:53:50,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:50,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208149046] [2022-10-15 17:53:50,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:50,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:51,214 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:53:51,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:51,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208149046] [2022-10-15 17:53:51,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208149046] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:51,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:51,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:53:51,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456068721] [2022-10-15 17:53:51,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:51,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:53:51,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:51,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:53:51,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:53:51,217 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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:53:51,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:51,273 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-10-15 17:53:51,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:53:51,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2022-10-15 17:53:51,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:51,275 INFO L225 Difference]: With dead ends: 39 [2022-10-15 17:53:51,275 INFO L226 Difference]: Without dead ends: 39 [2022-10-15 17:53:51,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:53:51,276 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 56 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:51,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 48 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:51,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-10-15 17:53:51,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-10-15 17:53:51,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.52) internal successors, (38), 32 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:53:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-10-15 17:53:51,281 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 9 [2022-10-15 17:53:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:51,282 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-10-15 17:53:51,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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:53:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-10-15 17:53:51,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 17:53:51,283 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:51,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:51,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 17:53:51,284 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:51,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:51,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1693144940, now seen corresponding path program 1 times [2022-10-15 17:53:51,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:51,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417197463] [2022-10-15 17:53:51,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:51,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:51,361 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:53:51,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:51,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417197463] [2022-10-15 17:53:51,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417197463] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:51,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:51,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:53:51,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528674673] [2022-10-15 17:53:51,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:51,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:53:51,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:51,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:53:51,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:53:51,364 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:53:51,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:51,426 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-10-15 17:53:51,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:53:51,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:53:51,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:51,428 INFO L225 Difference]: With dead ends: 33 [2022-10-15 17:53:51,428 INFO L226 Difference]: Without dead ends: 33 [2022-10-15 17:53:51,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:53:51,429 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 60 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:51,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 36 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:51,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-10-15 17:53:51,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-10-15 17:53:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.4) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-10-15 17:53:51,434 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 13 [2022-10-15 17:53:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:51,434 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-10-15 17:53:51,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:53:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-10-15 17:53:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 17:53:51,435 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:51,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:51,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 17:53:51,436 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:51,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:51,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1693144939, now seen corresponding path program 1 times [2022-10-15 17:53:51,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:51,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450393010] [2022-10-15 17:53:51,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:51,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:51,654 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:53:51,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:51,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450393010] [2022-10-15 17:53:51,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450393010] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:51,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:51,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:53:51,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401483107] [2022-10-15 17:53:51,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:51,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:53:51,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:51,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:53:51,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:53:51,658 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:51,734 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-10-15 17:53:51,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:53:51,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-15 17:53:51,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:51,735 INFO L225 Difference]: With dead ends: 34 [2022-10-15 17:53:51,735 INFO L226 Difference]: Without dead ends: 34 [2022-10-15 17:53:51,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:53:51,739 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 63 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:51,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 59 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:51,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-10-15 17:53:51,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-10-15 17:53:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:51,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-10-15 17:53:51,750 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 13 [2022-10-15 17:53:51,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:51,752 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-10-15 17:53:51,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:51,752 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-10-15 17:53:51,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 17:53:51,753 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:51,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:51,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 17:53:51,754 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:51,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:51,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1693161859, now seen corresponding path program 1 times [2022-10-15 17:53:51,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:51,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617105398] [2022-10-15 17:53:51,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:51,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:51,956 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:53:51,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:51,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617105398] [2022-10-15 17:53:51,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617105398] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:51,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:51,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:53:51,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635702962] [2022-10-15 17:53:51,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:51,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:53:51,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:51,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:53:51,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:53:51,960 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:53:51,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:51,983 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-10-15 17:53:51,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:53:51,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:53:51,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:51,984 INFO L225 Difference]: With dead ends: 28 [2022-10-15 17:53:51,984 INFO L226 Difference]: Without dead ends: 25 [2022-10-15 17:53:51,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:53:51,986 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:51,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 42 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:51,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-10-15 17:53:51,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-10-15 17:53:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 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:53:51,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-10-15 17:53:51,995 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 13 [2022-10-15 17:53:51,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:51,995 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-10-15 17:53:51,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:53:51,995 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-10-15 17:53:51,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 17:53:51,997 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:51,997 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:51,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 17:53:51,997 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:51,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:51,998 INFO L85 PathProgramCache]: Analyzing trace with hash 950889964, now seen corresponding path program 1 times [2022-10-15 17:53:51,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:51,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073283052] [2022-10-15 17:53:51,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:51,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:52,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:52,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073283052] [2022-10-15 17:53:52,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073283052] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:52,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:52,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:53:52,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208211048] [2022-10-15 17:53:52,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:52,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:53:52,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:52,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:53:52,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:53:52,038 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:53:52,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:52,047 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-10-15 17:53:52,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:53:52,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 17:53:52,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:52,048 INFO L225 Difference]: With dead ends: 26 [2022-10-15 17:53:52,048 INFO L226 Difference]: Without dead ends: 26 [2022-10-15 17:53:52,048 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:53:52,049 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 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:53:52,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:52,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-10-15 17:53:52,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-10-15 17:53:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.25) internal successors, (30), 25 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:53:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-10-15 17:53:52,052 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 17 [2022-10-15 17:53:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:52,053 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-10-15 17:53:52,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:53:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-10-15 17:53:52,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 17:53:52,054 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:52,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:52,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 17:53:52,055 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:52,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:52,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1028637879, now seen corresponding path program 1 times [2022-10-15 17:53:52,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:52,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716583977] [2022-10-15 17:53:52,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:52,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:52,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:52,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716583977] [2022-10-15 17:53:52,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716583977] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:52,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:52,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-15 17:53:52,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728199067] [2022-10-15 17:53:52,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:52,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 17:53:52,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:52,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 17:53:52,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:53:52,355 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:52,489 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-10-15 17:53:52,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 17:53:52,489 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-15 17:53:52,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:52,490 INFO L225 Difference]: With dead ends: 44 [2022-10-15 17:53:52,490 INFO L226 Difference]: Without dead ends: 44 [2022-10-15 17:53:52,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-10-15 17:53:52,491 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 35 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:52,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 130 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:53:52,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-10-15 17:53:52,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-10-15 17:53:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.175) internal successors, (47), 41 states have internal predecessors, (47), 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:53:52,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-10-15 17:53:52,496 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 19 [2022-10-15 17:53:52,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:52,496 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-10-15 17:53:52,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:52,496 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-10-15 17:53:52,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 17:53:52,497 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:52,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:52,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 17:53:52,498 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:52,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:52,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2049706233, now seen corresponding path program 1 times [2022-10-15 17:53:52,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:52,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229590988] [2022-10-15 17:53:52,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:52,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:53,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:53,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229590988] [2022-10-15 17:53:53,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229590988] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:53:53,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748291166] [2022-10-15 17:53:53,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:53,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:53:53,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:53:53,108 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:53:53,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 17:53:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:53,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 38 conjunts are in the unsatisfiable core [2022-10-15 17:53:53,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:53:53,329 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 17:53:53,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-10-15 17:53:53,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-15 17:53:53,528 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:53,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-10-15 17:53:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:53,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:53:53,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-10-15 17:53:53,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2022-10-15 17:53:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:54,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748291166] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:53:54,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:53:54,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-10-15 17:53:54,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715612836] [2022-10-15 17:53:54,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:53:54,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-15 17:53:54,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:54,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-15 17:53:54,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2022-10-15 17:53:54,006 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 25 states, 24 states have (on average 1.875) internal successors, (45), 25 states have internal predecessors, (45), 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:53:54,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:54,593 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-10-15 17:53:54,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 17:53:54,594 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-15 17:53:54,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:54,596 INFO L225 Difference]: With dead ends: 67 [2022-10-15 17:53:54,596 INFO L226 Difference]: Without dead ends: 67 [2022-10-15 17:53:54,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=937, Unknown=0, NotChecked=0, Total=1190 [2022-10-15 17:53:54,598 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 106 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:54,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 165 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:53:54,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-10-15 17:53:54,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2022-10-15 17:53:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 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:53:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-10-15 17:53:54,603 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 19 [2022-10-15 17:53:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:54,603 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-10-15 17:53:54,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.875) internal successors, (45), 25 states have internal predecessors, (45), 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:53:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-10-15 17:53:54,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 17:53:54,605 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:54,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:54,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 17:53:54,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-10-15 17:53:54,821 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:54,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:54,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1642547592, now seen corresponding path program 1 times [2022-10-15 17:53:54,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:54,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776055302] [2022-10-15 17:53:54,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:54,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:54,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:54,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776055302] [2022-10-15 17:53:54,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776055302] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:54,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:54,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-15 17:53:54,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669797433] [2022-10-15 17:53:54,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:54,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 17:53:54,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:54,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 17:53:54,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:53:54,975 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:55,168 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-10-15 17:53:55,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 17:53:55,168 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-10-15 17:53:55,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:55,169 INFO L225 Difference]: With dead ends: 43 [2022-10-15 17:53:55,169 INFO L226 Difference]: Without dead ends: 26 [2022-10-15 17:53:55,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-10-15 17:53:55,171 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:55,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 90 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:53:55,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-10-15 17:53:55,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2022-10-15 17:53:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-10-15 17:53:55,177 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2022-10-15 17:53:55,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:55,177 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-10-15 17:53:55,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:55,178 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-10-15 17:53:55,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 17:53:55,183 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:55,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:55,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 17:53:55,183 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:55,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:55,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1249520771, now seen corresponding path program 1 times [2022-10-15 17:53:55,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:55,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701777088] [2022-10-15 17:53:55,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:55,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:55,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:55,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701777088] [2022-10-15 17:53:55,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701777088] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:55,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:55,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-10-15 17:53:55,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953096494] [2022-10-15 17:53:55,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:55,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 17:53:55,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:55,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 17:53:55,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:53:55,671 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:55,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:55,895 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-10-15 17:53:55,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 17:53:55,895 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 17:53:55,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:55,896 INFO L225 Difference]: With dead ends: 40 [2022-10-15 17:53:55,896 INFO L226 Difference]: Without dead ends: 23 [2022-10-15 17:53:55,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2022-10-15 17:53:55,898 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 47 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:55,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 85 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:53:55,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-10-15 17:53:55,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-10-15 17:53:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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:53:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-10-15 17:53:55,900 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 22 [2022-10-15 17:53:55,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:55,901 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-10-15 17:53:55,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:55,901 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-10-15 17:53:55,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 17:53:55,902 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:55,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:55,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 17:53:55,902 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:55,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:55,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2067169221, now seen corresponding path program 1 times [2022-10-15 17:53:55,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:55,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285648110] [2022-10-15 17:53:55,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:55,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:56,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:56,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285648110] [2022-10-15 17:53:56,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285648110] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:53:56,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95837729] [2022-10-15 17:53:56,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:56,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:53:56,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:53:56,564 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:53:56,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 17:53:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:56,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 46 conjunts are in the unsatisfiable core [2022-10-15 17:53:56,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:53:56,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-15 17:53:56,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-10-15 17:53:56,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-15 17:53:56,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 17:53:56,885 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:56,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-10-15 17:53:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:56,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:53:57,267 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:57,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-10-15 17:53:57,277 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:57,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2022-10-15 17:53:57,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 3 [2022-10-15 17:53:57,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 17:53:57,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-15 17:53:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:57,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95837729] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:53:57,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:53:57,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 27 [2022-10-15 17:53:57,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848183761] [2022-10-15 17:53:57,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:53:57,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-10-15 17:53:57,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:57,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-10-15 17:53:57,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2022-10-15 17:53:57,446 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 28 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 28 states have internal predecessors, (58), 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:53:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:57,722 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-10-15 17:53:57,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 17:53:57,723 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 28 states have internal predecessors, (58), 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 22 [2022-10-15 17:53:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:57,723 INFO L225 Difference]: With dead ends: 34 [2022-10-15 17:53:57,724 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 17:53:57,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2022-10-15 17:53:57,725 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 134 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:57,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 126 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 157 Invalid, 0 Unknown, 1 Unchecked, 0.1s Time] [2022-10-15 17:53:57,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 17:53:57,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 17:53:57,726 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:53:57,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 17:53:57,727 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-10-15 17:53:57,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:57,727 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 17:53:57,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 28 states have internal predecessors, (58), 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:53:57,727 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 17:53:57,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 17:53:57,730 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2022-10-15 17:53:57,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2022-10-15 17:53:57,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2022-10-15 17:53:57,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2022-10-15 17:53:57,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2022-10-15 17:53:57,732 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2022-10-15 17:53:57,732 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2022-10-15 17:53:57,732 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2022-10-15 17:53:57,732 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2022-10-15 17:53:57,732 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2022-10-15 17:53:57,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2022-10-15 17:53:57,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2022-10-15 17:53:57,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 15 remaining) [2022-10-15 17:53:57,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2022-10-15 17:53:57,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2022-10-15 17:53:57,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 17:53:57,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-15 17:53:57,938 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:57,943 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:53:57,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:53:57 BoogieIcfgContainer [2022-10-15 17:53:57,950 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:53:57,952 INFO L158 Benchmark]: Toolchain (without parser) took 10818.11ms. Allocated memory was 152.0MB in the beginning and 219.2MB in the end (delta: 67.1MB). Free memory was 124.4MB in the beginning and 151.0MB in the end (delta: -26.6MB). Peak memory consumption was 41.4MB. Max. memory is 8.0GB. [2022-10-15 17:53:57,952 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 152.0MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:53:57,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 654.33ms. Allocated memory is still 152.0MB. Free memory was 124.2MB in the beginning and 107.1MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-10-15 17:53:57,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.07ms. Allocated memory is still 152.0MB. Free memory was 107.1MB in the beginning and 105.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:53:57,954 INFO L158 Benchmark]: Boogie Preprocessor took 33.30ms. Allocated memory is still 152.0MB. Free memory was 105.2MB in the beginning and 103.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:53:57,954 INFO L158 Benchmark]: RCFGBuilder took 681.36ms. Allocated memory is still 152.0MB. Free memory was 103.8MB in the beginning and 125.7MB in the end (delta: -21.9MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2022-10-15 17:53:57,956 INFO L158 Benchmark]: TraceAbstraction took 9352.66ms. Allocated memory was 152.0MB in the beginning and 219.2MB in the end (delta: 67.1MB). Free memory was 125.2MB in the beginning and 151.0MB in the end (delta: -25.9MB). Peak memory consumption was 41.2MB. Max. memory is 8.0GB. [2022-10-15 17:53:57,961 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.28ms. Allocated memory is still 152.0MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 654.33ms. Allocated memory is still 152.0MB. Free memory was 124.2MB in the beginning and 107.1MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.07ms. Allocated memory is still 152.0MB. Free memory was 107.1MB in the beginning and 105.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.30ms. Allocated memory is still 152.0MB. Free memory was 105.2MB in the beginning and 103.9MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 681.36ms. Allocated memory is still 152.0MB. Free memory was 103.8MB in the beginning and 125.7MB in the end (delta: -21.9MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. * TraceAbstraction took 9352.66ms. Allocated memory was 152.0MB in the beginning and 219.2MB in the end (delta: 67.1MB). Free memory was 125.2MB in the beginning and 151.0MB in the end (delta: -25.9MB). Peak memory consumption was 41.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: 379]: 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, 41 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 842 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 842 mSDsluCounter, 1142 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1 IncrementalHoareTripleChecker+Unchecked, 776 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1100 IncrementalHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 366 mSDtfsCounter, 1100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=12, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 70 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 273 ConstructedInterpolants, 1 QuantifiedInterpolants, 2340 SizeOfPredicates, 29 NumberOfNonLiveVariables, 274 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 4/10 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 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-10-15 17:53:58,016 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...