/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/termination-dietlibc/strcspn.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:55:36,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:55:36,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:55:36,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:55:36,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:55:36,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:55:36,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:55:36,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:55:36,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:55:36,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:55:36,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:55:36,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:55:36,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:55:36,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:55:36,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:55:36,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:55:36,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:55:36,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:55:36,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:55:36,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:55:36,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:55:36,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:55:36,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:55:36,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:55:36,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:55:36,892 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:55:36,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:55:36,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:55:36,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:55:36,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:55:36,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:55:36,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:55:36,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:55:36,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:55:36,904 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:55:36,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:55:36,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:55:36,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:55:36,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:55:36,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:55:36,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:55:36,912 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 17:55:36,973 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:55:36,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:55:36,974 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:55:36,974 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:55:36,977 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:55:36,977 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:55:36,980 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:55:36,980 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:55:36,981 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:55:36,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:55:36,982 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:55:36,983 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:55:36,983 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:55:36,983 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:55:36,983 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:55:36,983 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:55:36,984 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:55:36,984 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:55:36,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:55:36,984 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:55:36,985 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:55:36,985 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:55:36,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:55:36,985 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:55:36,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:55:36,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:55:36,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:55:36,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:55:36,986 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:55:36,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:55:36,987 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 17:55:37,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:55:37,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:55:37,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:55:37,456 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:55:37,456 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:55:37,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strcspn.i [2022-10-15 17:55:37,551 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f18bd001/58a111fe919842ca92e73065f78aee9d/FLAGb1aa64128 [2022-10-15 17:55:38,322 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:55:38,323 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strcspn.i [2022-10-15 17:55:38,348 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f18bd001/58a111fe919842ca92e73065f78aee9d/FLAGb1aa64128 [2022-10-15 17:55:38,610 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f18bd001/58a111fe919842ca92e73065f78aee9d [2022-10-15 17:55:38,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:55:38,623 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:55:38,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:55:38,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:55:38,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:55:38,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:55:38" (1/1) ... [2022-10-15 17:55:38,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5174d40d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:38, skipping insertion in model container [2022-10-15 17:55:38,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:55:38" (1/1) ... [2022-10-15 17:55:38,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:55:38,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:55:39,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:55:39,022 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:55:39,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:55:39,104 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:55:39,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:39 WrapperNode [2022-10-15 17:55:39,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:55:39,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:55:39,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:55:39,107 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:55:39,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:39" (1/1) ... [2022-10-15 17:55:39,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:39" (1/1) ... [2022-10-15 17:55:39,157 INFO L138 Inliner]: procedures = 113, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2022-10-15 17:55:39,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:55:39,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:55:39,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:55:39,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:55:39,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:39" (1/1) ... [2022-10-15 17:55:39,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:39" (1/1) ... [2022-10-15 17:55:39,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:39" (1/1) ... [2022-10-15 17:55:39,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:39" (1/1) ... [2022-10-15 17:55:39,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:39" (1/1) ... [2022-10-15 17:55:39,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:39" (1/1) ... [2022-10-15 17:55:39,187 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:39" (1/1) ... [2022-10-15 17:55:39,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:39" (1/1) ... [2022-10-15 17:55:39,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:55:39,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:55:39,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:55:39,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:55:39,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:39" (1/1) ... [2022-10-15 17:55:39,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:55:39,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:39,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 17:55:39,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 17:55:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 17:55:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 17:55:39,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 17:55:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 17:55:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:55:39,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:55:39,476 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:55:39,478 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:55:39,836 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:55:39,845 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:55:39,845 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 17:55:39,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:55:39 BoogieIcfgContainer [2022-10-15 17:55:39,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:55:39,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:55:39,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:55:39,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:55:39,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:55:38" (1/3) ... [2022-10-15 17:55:39,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696536ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:55:39, skipping insertion in model container [2022-10-15 17:55:39,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:39" (2/3) ... [2022-10-15 17:55:39,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696536ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:55:39, skipping insertion in model container [2022-10-15 17:55:39,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:55:39" (3/3) ... [2022-10-15 17:55:39,860 INFO L112 eAbstractionObserver]: Analyzing ICFG strcspn.i [2022-10-15 17:55:39,883 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:55:39,884 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-10-15 17:55:39,965 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:55:39,983 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;@2adf2ad4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:55:39,983 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-10-15 17:55:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:55:40,015 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:40,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:55:40,018 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:40,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:40,027 INFO L85 PathProgramCache]: Analyzing trace with hash 925667, now seen corresponding path program 1 times [2022-10-15 17:55:40,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:40,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697343994] [2022-10-15 17:55:40,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:40,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:40,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:40,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697343994] [2022-10-15 17:55:40,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697343994] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:40,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:40,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:55:40,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078108222] [2022-10-15 17:55:40,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:40,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:55:40,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:40,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:55:40,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:40,353 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:40,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:40,468 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-10-15 17:55:40,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:55:40,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 17:55:40,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:40,482 INFO L225 Difference]: With dead ends: 37 [2022-10-15 17:55:40,482 INFO L226 Difference]: Without dead ends: 34 [2022-10-15 17:55:40,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:40,495 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:40,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-10-15 17:55:40,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-10-15 17:55:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-10-15 17:55:40,532 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 4 [2022-10-15 17:55:40,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:40,533 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-10-15 17:55:40,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:40,534 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-10-15 17:55:40,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:55:40,534 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:40,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:55:40,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:55:40,535 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:40,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:40,536 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-10-15 17:55:40,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:40,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031762361] [2022-10-15 17:55:40,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:40,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:40,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:40,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031762361] [2022-10-15 17:55:40,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031762361] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:40,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:40,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:55:40,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385076116] [2022-10-15 17:55:40,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:40,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:55:40,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:40,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:55:40,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:40,672 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:40,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:40,739 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-10-15 17:55:40,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:55:40,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 17:55:40,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:40,744 INFO L225 Difference]: With dead ends: 33 [2022-10-15 17:55:40,744 INFO L226 Difference]: Without dead ends: 33 [2022-10-15 17:55:40,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:40,751 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 20 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:55:40,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 20 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:40,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-10-15 17:55:40,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-10-15 17:55:40,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-10-15 17:55:40,766 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 4 [2022-10-15 17:55:40,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:40,766 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-10-15 17:55:40,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-10-15 17:55:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:55:40,767 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:40,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:55:40,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:55:40,768 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:40,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:40,774 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2022-10-15 17:55:40,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:40,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943136268] [2022-10-15 17:55:40,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:40,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:40,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:40,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943136268] [2022-10-15 17:55:40,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943136268] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:40,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:40,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:55:40,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613408249] [2022-10-15 17:55:40,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:40,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:55:40,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:40,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:55:40,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:40,967 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:41,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:41,000 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-10-15 17:55:41,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:55:41,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 17:55:41,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:41,002 INFO L225 Difference]: With dead ends: 34 [2022-10-15 17:55:41,002 INFO L226 Difference]: Without dead ends: 34 [2022-10-15 17:55:41,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:41,004 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:41,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 51 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:41,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-10-15 17:55:41,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-10-15 17:55:41,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 31 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:55:41,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-10-15 17:55:41,011 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 4 [2022-10-15 17:55:41,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:41,011 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-10-15 17:55:41,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:41,012 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-10-15 17:55:41,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 17:55:41,012 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:41,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:41,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:55:41,013 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:41,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:41,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782697, now seen corresponding path program 1 times [2022-10-15 17:55:41,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:41,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049116663] [2022-10-15 17:55:41,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:41,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:41,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:41,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049116663] [2022-10-15 17:55:41,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049116663] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:41,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:41,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:55:41,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579917465] [2022-10-15 17:55:41,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:41,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:55:41,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:41,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:55:41,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:41,121 INFO L87 Difference]: Start difference. First operand 32 states and 35 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:55:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:41,154 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-10-15 17:55:41,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:55:41,155 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:55:41,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:41,156 INFO L225 Difference]: With dead ends: 31 [2022-10-15 17:55:41,156 INFO L226 Difference]: Without dead ends: 31 [2022-10-15 17:55:41,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:41,158 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:41,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 23 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:41,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-10-15 17:55:41,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-10-15 17:55:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.619047619047619) internal successors, (34), 30 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:55:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-10-15 17:55:41,165 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 7 [2022-10-15 17:55:41,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:41,165 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-10-15 17:55:41,166 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:55:41,166 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-10-15 17:55:41,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 17:55:41,166 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:41,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:41,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:55:41,167 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:41,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:41,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782698, now seen corresponding path program 1 times [2022-10-15 17:55:41,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:41,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903213421] [2022-10-15 17:55:41,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:41,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:41,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:41,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903213421] [2022-10-15 17:55:41,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903213421] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:41,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:41,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:55:41,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97760750] [2022-10-15 17:55:41,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:41,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:55:41,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:41,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:55:41,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:41,411 INFO L87 Difference]: Start difference. First operand 31 states and 34 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:55:41,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:41,448 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-10-15 17:55:41,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:55:41,448 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:55:41,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:41,449 INFO L225 Difference]: With dead ends: 32 [2022-10-15 17:55:41,450 INFO L226 Difference]: Without dead ends: 32 [2022-10-15 17:55:41,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:41,452 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:41,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 26 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:41,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-10-15 17:55:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-10-15 17:55:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-10-15 17:55:41,458 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 7 [2022-10-15 17:55:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:41,458 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-10-15 17:55:41,459 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:55:41,459 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-10-15 17:55:41,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 17:55:41,460 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:41,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:41,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 17:55:41,460 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:41,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:41,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782686, now seen corresponding path program 1 times [2022-10-15 17:55:41,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:41,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173005653] [2022-10-15 17:55:41,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:41,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:41,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:41,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:41,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173005653] [2022-10-15 17:55:41,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173005653] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:41,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:41,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:55:41,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164649970] [2022-10-15 17:55:41,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:41,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:55:41,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:41,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:55:41,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:55:41,558 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:41,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:41,594 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-10-15 17:55:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:55:41,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-15 17:55:41,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:41,596 INFO L225 Difference]: With dead ends: 31 [2022-10-15 17:55:41,596 INFO L226 Difference]: Without dead ends: 30 [2022-10-15 17:55:41,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:55:41,598 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:41,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:41,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-10-15 17:55:41,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-10-15 17:55:41,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-10-15 17:55:41,603 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 7 [2022-10-15 17:55:41,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:41,604 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-10-15 17:55:41,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-10-15 17:55:41,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 17:55:41,605 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:41,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:41,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 17:55:41,605 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:41,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:41,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1151383917, now seen corresponding path program 1 times [2022-10-15 17:55:41,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:41,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774677982] [2022-10-15 17:55:41,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:41,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:41,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:41,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774677982] [2022-10-15 17:55:41,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774677982] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:41,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:41,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:55:41,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351237045] [2022-10-15 17:55:41,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:41,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:55:41,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:41,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:55:41,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:55:41,787 INFO L87 Difference]: Start difference. First operand 30 states and 32 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:55:41,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:41,853 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-10-15 17:55:41,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:55:41,854 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:55:41,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:41,854 INFO L225 Difference]: With dead ends: 28 [2022-10-15 17:55:41,854 INFO L226 Difference]: Without dead ends: 28 [2022-10-15 17:55:41,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:55:41,858 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 39 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:41,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 17 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:41,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-10-15 17:55:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-10-15 17:55:41,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 27 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:55:41,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-10-15 17:55:41,874 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 9 [2022-10-15 17:55:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:41,874 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-10-15 17:55:41,875 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:55:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-10-15 17:55:41,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 17:55:41,876 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:41,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:41,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 17:55:41,877 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:41,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:41,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1151383918, now seen corresponding path program 1 times [2022-10-15 17:55:41,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:41,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023263485] [2022-10-15 17:55:41,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:41,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:42,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:42,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023263485] [2022-10-15 17:55:42,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023263485] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:42,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:42,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:55:42,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285211383] [2022-10-15 17:55:42,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:42,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:55:42,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:42,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:55:42,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:55:42,173 INFO L87 Difference]: Start difference. First operand 28 states and 30 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:55:42,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:42,265 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-10-15 17:55:42,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:55:42,266 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:55:42,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:42,270 INFO L225 Difference]: With dead ends: 46 [2022-10-15 17:55:42,270 INFO L226 Difference]: Without dead ends: 46 [2022-10-15 17:55:42,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:55:42,272 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 61 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:42,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 28 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:42,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-15 17:55:42,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2022-10-15 17:55:42,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 35 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:55:42,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-10-15 17:55:42,294 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 9 [2022-10-15 17:55:42,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:42,294 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-10-15 17:55:42,294 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:55:42,294 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-10-15 17:55:42,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 17:55:42,299 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:42,300 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:42,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 17:55:42,300 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:42,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:42,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1621618095, now seen corresponding path program 1 times [2022-10-15 17:55:42,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:42,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208965945] [2022-10-15 17:55:42,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:42,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:42,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:42,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208965945] [2022-10-15 17:55:42,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208965945] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:42,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:42,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:55:42,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022179430] [2022-10-15 17:55:42,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:42,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:55:42,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:42,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:55:42,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:55:42,429 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:42,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:42,472 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-10-15 17:55:42,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:55:42,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-15 17:55:42,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:42,474 INFO L225 Difference]: With dead ends: 34 [2022-10-15 17:55:42,474 INFO L226 Difference]: Without dead ends: 34 [2022-10-15 17:55:42,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:55:42,477 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 35 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:42,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 21 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:42,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-10-15 17:55:42,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-10-15 17:55:42,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-10-15 17:55:42,497 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 11 [2022-10-15 17:55:42,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:42,498 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-10-15 17:55:42,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:42,498 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-10-15 17:55:42,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 17:55:42,504 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:42,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:42,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 17:55:42,505 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:42,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:42,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1621618094, now seen corresponding path program 1 times [2022-10-15 17:55:42,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:42,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163837056] [2022-10-15 17:55:42,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:42,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:42,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:42,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:42,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163837056] [2022-10-15 17:55:42,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163837056] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:42,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:42,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:55:42,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091075987] [2022-10-15 17:55:42,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:42,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:55:42,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:42,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:55:42,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:55:42,712 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:42,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:42,816 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-10-15 17:55:42,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:55:42,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-15 17:55:42,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:42,819 INFO L225 Difference]: With dead ends: 56 [2022-10-15 17:55:42,819 INFO L226 Difference]: Without dead ends: 56 [2022-10-15 17:55:42,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:55:42,820 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 68 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:42,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 41 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:42,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-10-15 17:55:42,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2022-10-15 17:55:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 41 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-10-15 17:55:42,825 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 11 [2022-10-15 17:55:42,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:42,825 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-10-15 17:55:42,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:42,825 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-10-15 17:55:42,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 17:55:42,828 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:42,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:42,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 17:55:42,829 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:42,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:42,829 INFO L85 PathProgramCache]: Analyzing trace with hash 698109586, now seen corresponding path program 1 times [2022-10-15 17:55:42,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:42,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385827306] [2022-10-15 17:55:42,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:42,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:43,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:43,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385827306] [2022-10-15 17:55:43,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385827306] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:43,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:43,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:55:43,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12004070] [2022-10-15 17:55:43,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:43,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:55:43,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:43,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:55:43,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:55:43,070 INFO L87 Difference]: Start difference. First operand 42 states and 52 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:55:43,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:43,110 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-10-15 17:55:43,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:55:43,111 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:55:43,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:43,113 INFO L225 Difference]: With dead ends: 41 [2022-10-15 17:55:43,113 INFO L226 Difference]: Without dead ends: 38 [2022-10-15 17:55:43,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:55:43,115 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:43,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 49 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:43,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-10-15 17:55:43,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-10-15 17:55:43,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 37 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:55:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-10-15 17:55:43,124 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 13 [2022-10-15 17:55:43,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:43,124 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-10-15 17:55:43,124 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:55:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-10-15 17:55:43,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 17:55:43,126 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:43,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:43,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 17:55:43,136 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:43,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:43,137 INFO L85 PathProgramCache]: Analyzing trace with hash 897154592, now seen corresponding path program 1 times [2022-10-15 17:55:43,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:43,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907091805] [2022-10-15 17:55:43,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:43,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:43,754 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:55:43,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:43,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907091805] [2022-10-15 17:55:43,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907091805] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:55:43,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412124799] [2022-10-15 17:55:43,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:43,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:43,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:43,762 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:55:43,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 17:55:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:43,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2022-10-15 17:55:43,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:55:44,012 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 14 treesize of output 10 [2022-10-15 17:55:44,174 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 17:55:44,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-10-15 17:55:44,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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:55:44,313 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 17 treesize of output 19 [2022-10-15 17:55:44,529 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:44,530 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 18 treesize of output 19 [2022-10-15 17:55:44,675 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:55:44,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:55:44,929 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_strcspn_~s#1.offset_11| Int) (v_ArrVal_83 (Array Int Int))) (or (<= (+ 2 |v_ULTIMATE.start_strcspn_~s#1.offset_11|) (select |c_#length| |c_ULTIMATE.start_main_~in~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_strcspn_~s#1.offset_11|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~out~0#1.base| v_ArrVal_83) |c_ULTIMATE.start_main_~in~0#1.base|) |v_ULTIMATE.start_strcspn_~s#1.offset_11|) 0) (< |c_ULTIMATE.start_main_~in~0#1.offset| |v_ULTIMATE.start_strcspn_~s#1.offset_11|))) is different from false [2022-10-15 17:55:44,963 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_strcspn_~s#1.offset_11| Int) (v_ArrVal_83 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc12#1.base_5| Int) (v_ArrVal_82 Int)) (or (<= (+ 2 |v_ULTIMATE.start_strcspn_~s#1.offset_11|) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc12#1.base_5| v_ArrVal_82) |c_ULTIMATE.start_main_~in~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_strcspn_~s#1.offset_11|)) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc12#1.base_5| v_ArrVal_83) |c_ULTIMATE.start_main_~in~0#1.base|) |v_ULTIMATE.start_strcspn_~s#1.offset_11|) 0) (< |c_ULTIMATE.start_main_~in~0#1.offset| |v_ULTIMATE.start_strcspn_~s#1.offset_11|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc12#1.base_5|) 0)))) is different from false [2022-10-15 17:55:45,036 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:45,037 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:55:45,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 17:55:45,049 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 16 treesize of output 12 [2022-10-15 17:55:45,059 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 17:55:45,069 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-10-15 17:55:45,069 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 19 treesize of output 15 [2022-10-15 17:55:45,078 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-15 17:55:45,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 12 [2022-10-15 17:55:45,095 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:55:45,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412124799] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:55:45,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:55:45,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2022-10-15 17:55:45,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898386145] [2022-10-15 17:55:45,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:55:45,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-15 17:55:45,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:45,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-15 17:55:45,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=354, Unknown=2, NotChecked=78, Total=506 [2022-10-15 17:55:45,098 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:45,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:45,426 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-10-15 17:55:45,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 17:55:45,427 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 17:55:45,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:45,427 INFO L225 Difference]: With dead ends: 57 [2022-10-15 17:55:45,428 INFO L226 Difference]: Without dead ends: 57 [2022-10-15 17:55:45,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=507, Unknown=2, NotChecked=94, Total=702 [2022-10-15 17:55:45,429 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 91 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:45,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 112 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 91 Unchecked, 0.1s Time] [2022-10-15 17:55:45,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-10-15 17:55:45,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2022-10-15 17:55:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-10-15 17:55:45,433 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 15 [2022-10-15 17:55:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:45,434 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-10-15 17:55:45,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-10-15 17:55:45,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 17:55:45,435 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:45,435 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:55:45,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 17:55:45,647 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,SelfDestructingSolverStorable11 [2022-10-15 17:55:45,648 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:45,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:45,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1080800794, now seen corresponding path program 1 times [2022-10-15 17:55:45,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:45,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487841652] [2022-10-15 17:55:45,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:45,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:46,021 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:55:46,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:46,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487841652] [2022-10-15 17:55:46,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487841652] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:55:46,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846685411] [2022-10-15 17:55:46,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:46,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:46,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:46,024 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:55:46,026 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:55:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:46,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 26 conjunts are in the unsatisfiable core [2022-10-15 17:55:46,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:55:46,116 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 14 treesize of output 10 [2022-10-15 17:55:46,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:46,266 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 20 treesize of output 17 [2022-10-15 17:55:46,399 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:55:46,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:55:46,644 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:55:46,647 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 14 treesize of output 12 [2022-10-15 17:55:46,652 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 22 treesize of output 18 [2022-10-15 17:55:46,694 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:55:46,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846685411] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:55:46,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:55:46,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-10-15 17:55:46,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750536463] [2022-10-15 17:55:46,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:55:46,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-15 17:55:46,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:46,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-15 17:55:46,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2022-10-15 17:55:46,697 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:47,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:47,021 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-10-15 17:55:47,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 17:55:47,021 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 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) Word has length 17 [2022-10-15 17:55:47,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:47,022 INFO L225 Difference]: With dead ends: 47 [2022-10-15 17:55:47,022 INFO L226 Difference]: Without dead ends: 47 [2022-10-15 17:55:47,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2022-10-15 17:55:47,024 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:47,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 145 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 185 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2022-10-15 17:55:47,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-15 17:55:47,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2022-10-15 17:55:47,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.225) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:47,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-10-15 17:55:47,027 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 17 [2022-10-15 17:55:47,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:47,028 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-10-15 17:55:47,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:47,028 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-10-15 17:55:47,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 17:55:47,029 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:47,029 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:47,078 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:55:47,239 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,SelfDestructingSolverStorable12 [2022-10-15 17:55:47,239 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:47,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:47,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1233346219, now seen corresponding path program 1 times [2022-10-15 17:55:47,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:47,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053321638] [2022-10-15 17:55:47,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:47,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 17:55:47,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:47,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053321638] [2022-10-15 17:55:47,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053321638] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:47,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:47,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:55:47,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482046227] [2022-10-15 17:55:47,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:47,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:55:47,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:47,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:55:47,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:47,287 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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:55:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:47,306 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-10-15 17:55:47,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:55:47,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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:55:47,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:47,307 INFO L225 Difference]: With dead ends: 42 [2022-10-15 17:55:47,308 INFO L226 Difference]: Without dead ends: 42 [2022-10-15 17:55:47,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:47,309 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:47,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 21 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:47,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-10-15 17:55:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2022-10-15 17:55:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-10-15 17:55:47,312 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 20 [2022-10-15 17:55:47,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:47,312 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-10-15 17:55:47,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 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:55:47,312 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-10-15 17:55:47,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-15 17:55:47,313 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:47,313 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:47,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 17:55:47,314 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:47,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:47,314 INFO L85 PathProgramCache]: Analyzing trace with hash 834958674, now seen corresponding path program 2 times [2022-10-15 17:55:47,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:47,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995516733] [2022-10-15 17:55:47,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:47,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:47,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:47,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995516733] [2022-10-15 17:55:47,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995516733] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:55:47,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237100861] [2022-10-15 17:55:47,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:55:47,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:47,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:47,970 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:55:47,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 17:55:48,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:55:48,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:55:48,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 59 conjunts are in the unsatisfiable core [2022-10-15 17:55:48,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:55:48,072 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 17:55:48,097 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 14 treesize of output 10 [2022-10-15 17:55:48,165 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 17:55:48,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 23 [2022-10-15 17:55:48,264 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 17:55:48,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 45 treesize of output 49 [2022-10-15 17:55:48,283 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:55:48,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 17:55:48,881 INFO L356 Elim1Store]: treesize reduction 12, result has 69.2 percent of original size [2022-10-15 17:55:48,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 56 [2022-10-15 17:55:48,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:48,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:55:50,062 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:50,063 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 43 treesize of output 32 [2022-10-15 17:55:50,072 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 17:55:50,082 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:50,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 59 [2022-10-15 17:55:50,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 17:55:50,096 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 17:55:50,101 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:50,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2022-10-15 17:55:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:50,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237100861] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:55:50,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:55:50,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 33 [2022-10-15 17:55:50,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911599192] [2022-10-15 17:55:50,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:55:50,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-10-15 17:55:50,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:50,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-10-15 17:55:50,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=994, Unknown=3, NotChecked=0, Total=1122 [2022-10-15 17:55:50,357 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 34 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:51,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:51,358 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-10-15 17:55:51,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-15 17:55:51,359 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-10-15 17:55:51,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:51,359 INFO L225 Difference]: With dead ends: 57 [2022-10-15 17:55:51,359 INFO L226 Difference]: Without dead ends: 57 [2022-10-15 17:55:51,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=271, Invalid=1982, Unknown=3, NotChecked=0, Total=2256 [2022-10-15 17:55:51,361 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 41 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:51,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 180 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 71 Unchecked, 0.1s Time] [2022-10-15 17:55:51,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-10-15 17:55:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-10-15 17:55:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 49 states have (on average 1.163265306122449) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-10-15 17:55:51,365 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 21 [2022-10-15 17:55:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:51,366 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-10-15 17:55:51,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:51,366 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-10-15 17:55:51,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 17:55:51,367 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:51,367 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:51,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 17:55:51,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:51,580 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:51,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:51,582 INFO L85 PathProgramCache]: Analyzing trace with hash -721535848, now seen corresponding path program 1 times [2022-10-15 17:55:51,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:51,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711484286] [2022-10-15 17:55:51,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:51,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 17:55:51,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:51,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711484286] [2022-10-15 17:55:51,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711484286] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:55:51,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811034071] [2022-10-15 17:55:51,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:51,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:51,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:51,974 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:55:52,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 17:55:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:52,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjunts are in the unsatisfiable core [2022-10-15 17:55:52,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:55:52,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-15 17:55:52,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:52,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:55:52,245 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-15 17:55:52,246 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 18 treesize of output 11 [2022-10-15 17:55:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:52,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811034071] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:55:52,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:55:52,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 20 [2022-10-15 17:55:52,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945484421] [2022-10-15 17:55:52,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:55:52,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-15 17:55:52,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:52,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-15 17:55:52,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-10-15 17:55:52,263 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 20 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:52,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:52,808 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-10-15 17:55:52,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 17:55:52,809 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 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 23 [2022-10-15 17:55:52,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:52,809 INFO L225 Difference]: With dead ends: 94 [2022-10-15 17:55:52,810 INFO L226 Difference]: Without dead ends: 94 [2022-10-15 17:55:52,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=249, Invalid=681, Unknown=0, NotChecked=0, Total=930 [2022-10-15 17:55:52,811 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 122 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:52,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 125 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:55:52,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-10-15 17:55:52,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 66. [2022-10-15 17:55:52,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 64 states have (on average 1.125) internal successors, (72), 65 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:52,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2022-10-15 17:55:52,815 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 23 [2022-10-15 17:55:52,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:52,815 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2022-10-15 17:55:52,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:52,816 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2022-10-15 17:55:52,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 17:55:52,816 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:52,817 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:52,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-15 17:55:53,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-15 17:55:53,028 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:53,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:53,029 INFO L85 PathProgramCache]: Analyzing trace with hash -828013958, now seen corresponding path program 2 times [2022-10-15 17:55:53,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:53,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900540662] [2022-10-15 17:55:53,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:53,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:53,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:53,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900540662] [2022-10-15 17:55:53,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900540662] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:55:53,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482977256] [2022-10-15 17:55:53,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:55:53,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:53,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:53,507 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:55:53,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-15 17:55:53,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:55:53,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:55:53,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 28 conjunts are in the unsatisfiable core [2022-10-15 17:55:53,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:55:53,598 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 17:55:53,618 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 16 treesize of output 12 [2022-10-15 17:55:53,759 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:53,760 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 21 treesize of output 20 [2022-10-15 17:55:53,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:53,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:55:56,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2022-10-15 17:55:56,552 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 26 treesize of output 22 [2022-10-15 17:55:56,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2022-10-15 17:55:56,580 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 26 treesize of output 22 [2022-10-15 17:55:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:56,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482977256] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:55:56,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:55:56,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-10-15 17:55:56,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445377094] [2022-10-15 17:55:56,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:55:56,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-10-15 17:55:56,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:56,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-10-15 17:55:56,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2022-10-15 17:55:56,646 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 26 states, 25 states have (on average 2.36) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:57,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:57,484 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-10-15 17:55:57,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 17:55:57,485 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.36) internal successors, (59), 26 states have internal predecessors, (59), 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 23 [2022-10-15 17:55:57,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:57,486 INFO L225 Difference]: With dead ends: 91 [2022-10-15 17:55:57,486 INFO L226 Difference]: Without dead ends: 91 [2022-10-15 17:55:57,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2022-10-15 17:55:57,489 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 196 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:57,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 117 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 245 Invalid, 0 Unknown, 14 Unchecked, 0.3s Time] [2022-10-15 17:55:57,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-10-15 17:55:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 55. [2022-10-15 17:55:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-10-15 17:55:57,498 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 23 [2022-10-15 17:55:57,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:57,500 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-10-15 17:55:57,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.36) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:57,501 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-10-15 17:55:57,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-15 17:55:57,505 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:57,505 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:57,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-10-15 17:55:57,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-15 17:55:57,722 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-10-15 17:55:57,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:57,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1839154150, now seen corresponding path program 1 times [2022-10-15 17:55:57,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:57,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387939839] [2022-10-15 17:55:57,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:57,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 17:55:58,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:58,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387939839] [2022-10-15 17:55:58,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387939839] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:55:58,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745268027] [2022-10-15 17:55:58,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:58,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:58,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:58,330 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:55:58,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-15 17:55:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:58,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 38 conjunts are in the unsatisfiable core [2022-10-15 17:55:58,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:55:58,418 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 17:55:58,438 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 15 treesize of output 11 [2022-10-15 17:55:58,472 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 17:55:58,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-10-15 17:55:58,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 20 [2022-10-15 17:55:58,509 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 18 treesize of output 20 [2022-10-15 17:55:58,650 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:58,651 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 19 treesize of output 19 [2022-10-15 17:55:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 17:55:58,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:55:59,431 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_strcspn_~s#1.offset_23| Int) (v_ArrVal_185 Int) (v_ArrVal_186 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc12#1.base_9| Int)) (let ((.cse0 (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc12#1.base_9| v_ArrVal_185) |c_ULTIMATE.start_main_~in~0#1.base|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc12#1.base_9|) 0)) (not (<= (+ |v_ULTIMATE.start_strcspn_~s#1.offset_23| 1) .cse0)) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc12#1.base_9| v_ArrVal_186) |c_ULTIMATE.start_main_~in~0#1.base|) |v_ULTIMATE.start_strcspn_~s#1.offset_23|) 0) (<= (+ 2 |v_ULTIMATE.start_strcspn_~s#1.offset_23|) .cse0) (< |v_ULTIMATE.start_strcspn_~s#1.offset_23| 1)))) is different from false [2022-10-15 17:55:59,480 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:59,481 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:55:59,499 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-15 17:55:59,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 12 [2022-10-15 17:55:59,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 17:55:59,512 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-10-15 17:55:59,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2022-10-15 17:55:59,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 17:55:59,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745268027] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:55:59,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:55:59,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2022-10-15 17:55:59,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364108268] [2022-10-15 17:55:59,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:55:59,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-10-15 17:55:59,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:59,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-10-15 17:55:59,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=613, Unknown=5, NotChecked=50, Total=756 [2022-10-15 17:55:59,664 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 28 states have internal predecessors, (69), 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:56:00,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:56:00,309 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2022-10-15 17:56:00,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 17:56:00,310 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 28 states have internal predecessors, (69), 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 27 [2022-10-15 17:56:00,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:56:00,311 INFO L225 Difference]: With dead ends: 67 [2022-10-15 17:56:00,311 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 17:56:00,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=290, Invalid=1115, Unknown=5, NotChecked=72, Total=1482 [2022-10-15 17:56:00,314 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 190 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:56:00,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 97 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 100 Invalid, 0 Unknown, 64 Unchecked, 0.1s Time] [2022-10-15 17:56:00,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 17:56:00,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 17:56:00,315 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:56:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 17:56:00,315 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2022-10-15 17:56:00,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:56:00,316 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 17:56:00,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 28 states have internal predecessors, (69), 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:56:00,317 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 17:56:00,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 17:56:00,320 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 13 remaining) [2022-10-15 17:56:00,321 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2022-10-15 17:56:00,321 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-10-15 17:56:00,322 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-10-15 17:56:00,322 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-10-15 17:56:00,322 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-10-15 17:56:00,322 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-10-15 17:56:00,322 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-10-15 17:56:00,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2022-10-15 17:56:00,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 13 remaining) [2022-10-15 17:56:00,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2022-10-15 17:56:00,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2022-10-15 17:56:00,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-10-15 17:56:00,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-15 17:56:00,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-15 17:56:00,562 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:56:00,568 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:56:00,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:56:00 BoogieIcfgContainer [2022-10-15 17:56:00,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:56:00,575 INFO L158 Benchmark]: Toolchain (without parser) took 21955.17ms. Allocated memory was 151.0MB in the beginning and 314.6MB in the end (delta: 163.6MB). Free memory was 124.4MB in the beginning and 293.0MB in the end (delta: -168.7MB). Peak memory consumption was 148.7MB. Max. memory is 8.0GB. [2022-10-15 17:56:00,576 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 151.0MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:56:00,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 477.78ms. Allocated memory is still 151.0MB. Free memory was 124.2MB in the beginning and 108.9MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-10-15 17:56:00,577 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.68ms. Allocated memory is still 151.0MB. Free memory was 108.9MB in the beginning and 107.0MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:56:00,578 INFO L158 Benchmark]: Boogie Preprocessor took 32.93ms. Allocated memory is still 151.0MB. Free memory was 107.0MB in the beginning and 105.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:56:00,579 INFO L158 Benchmark]: RCFGBuilder took 655.83ms. Allocated memory is still 151.0MB. Free memory was 105.6MB in the beginning and 126.4MB in the end (delta: -20.9MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. [2022-10-15 17:56:00,579 INFO L158 Benchmark]: TraceAbstraction took 20721.22ms. Allocated memory was 151.0MB in the beginning and 314.6MB in the end (delta: 163.6MB). Free memory was 125.4MB in the beginning and 293.0MB in the end (delta: -167.6MB). Peak memory consumption was 150.3MB. Max. memory is 8.0GB. [2022-10-15 17:56:00,584 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.22ms. Allocated memory is still 151.0MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 477.78ms. Allocated memory is still 151.0MB. Free memory was 124.2MB in the beginning and 108.9MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.68ms. Allocated memory is still 151.0MB. Free memory was 108.9MB in the beginning and 107.0MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.93ms. Allocated memory is still 151.0MB. Free memory was 107.0MB in the beginning and 105.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 655.83ms. Allocated memory is still 151.0MB. Free memory was 105.6MB in the beginning and 126.4MB in the end (delta: -20.9MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. * TraceAbstraction took 20721.22ms. Allocated memory was 151.0MB in the beginning and 314.6MB in the end (delta: 163.6MB). Free memory was 125.4MB in the beginning and 293.0MB in the end (delta: -167.6MB). Peak memory consumption was 150.3MB. 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: 517]: 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, 36 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 20.6s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 973 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 973 mSDsluCounter, 1189 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 295 IncrementalHoareTripleChecker+Unchecked, 809 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1215 IncrementalHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 380 mSDtfsCounter, 1215 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 411 GetRequests, 178 SyntacticMatches, 5 SemanticMatches, 228 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=16, InterpolantAutomatonStates: 129, 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, 18 MinimizatonAttempts, 122 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 358 NumberOfCodeBlocks, 358 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 454 ConstructedInterpolants, 63 QuantifiedInterpolants, 7218 SizeOfPredicates, 77 NumberOfNonLiveVariables, 785 ConjunctsInSsa, 201 ConjunctsInUnsatCore, 30 InterpolantComputations, 12 PerfectInterpolantSequences, 25/112 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 13 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-10-15 17:56:00,629 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...