/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 04:38:16,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 04:38:16,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 04:38:16,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 04:38:16,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 04:38:16,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 04:38:16,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 04:38:16,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 04:38:16,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 04:38:16,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 04:38:16,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 04:38:16,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 04:38:16,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 04:38:16,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 04:38:16,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 04:38:16,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 04:38:16,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 04:38:16,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 04:38:16,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 04:38:16,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 04:38:16,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 04:38:16,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 04:38:16,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 04:38:16,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 04:38:16,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 04:38:16,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 04:38:16,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 04:38:16,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 04:38:16,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 04:38:16,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 04:38:16,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 04:38:16,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 04:38:16,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 04:38:16,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 04:38:16,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 04:38:16,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 04:38:16,912 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 04:38:16,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 04:38:16,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 04:38:16,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 04:38:16,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 04:38:16,916 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-16 04:38:16,961 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 04:38:16,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 04:38:16,962 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 04:38:16,962 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 04:38:16,965 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 04:38:16,965 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 04:38:16,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 04:38:16,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 04:38:16,968 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 04:38:16,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 04:38:16,970 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 04:38:16,970 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 04:38:16,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 04:38:16,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 04:38:16,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 04:38:16,971 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-16 04:38:16,971 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-16 04:38:16,971 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-16 04:38:16,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 04:38:16,972 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-16 04:38:16,972 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 04:38:16,972 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 04:38:16,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 04:38:16,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 04:38:16,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 04:38:16,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 04:38:16,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 04:38:16,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 04:38:16,974 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 04:38:16,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 04:38:16,975 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-16 04:38:17,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 04:38:17,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 04:38:17,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 04:38:17,404 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 04:38:17,405 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 04:38:17,407 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca.i [2022-10-16 04:38:17,485 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed56aaa6e/e888a8caa117487d8866ff036a4a6582/FLAG39ef61ca6 [2022-10-16 04:38:18,220 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 04:38:18,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/NoriSharma-2013FSE-Fig8-alloca.i [2022-10-16 04:38:18,233 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed56aaa6e/e888a8caa117487d8866ff036a4a6582/FLAG39ef61ca6 [2022-10-16 04:38:18,524 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed56aaa6e/e888a8caa117487d8866ff036a4a6582 [2022-10-16 04:38:18,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 04:38:18,536 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 04:38:18,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 04:38:18,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 04:38:18,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 04:38:18,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:38:18" (1/1) ... [2022-10-16 04:38:18,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@458c267a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:18, skipping insertion in model container [2022-10-16 04:38:18,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:38:18" (1/1) ... [2022-10-16 04:38:18,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 04:38:18,625 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 04:38:18,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 04:38:18,939 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 04:38:19,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 04:38:19,064 INFO L208 MainTranslator]: Completed translation [2022-10-16 04:38:19,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:19 WrapperNode [2022-10-16 04:38:19,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 04:38:19,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 04:38:19,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 04:38:19,067 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 04:38:19,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:19" (1/1) ... [2022-10-16 04:38:19,111 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:19" (1/1) ... [2022-10-16 04:38:19,146 INFO L138 Inliner]: procedures = 109, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 71 [2022-10-16 04:38:19,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 04:38:19,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 04:38:19,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 04:38:19,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 04:38:19,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:19" (1/1) ... [2022-10-16 04:38:19,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:19" (1/1) ... [2022-10-16 04:38:19,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:19" (1/1) ... [2022-10-16 04:38:19,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:19" (1/1) ... [2022-10-16 04:38:19,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:19" (1/1) ... [2022-10-16 04:38:19,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:19" (1/1) ... [2022-10-16 04:38:19,176 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:19" (1/1) ... [2022-10-16 04:38:19,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:19" (1/1) ... [2022-10-16 04:38:19,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 04:38:19,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 04:38:19,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 04:38:19,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 04:38:19,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:19" (1/1) ... [2022-10-16 04:38:19,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 04:38:19,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:38:19,227 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-16 04:38:19,240 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-16 04:38:19,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 04:38:19,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 04:38:19,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 04:38:19,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 04:38:19,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 04:38:19,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 04:38:19,409 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 04:38:19,412 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 04:38:19,796 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 04:38:19,804 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 04:38:19,804 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-16 04:38:19,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:38:19 BoogieIcfgContainer [2022-10-16 04:38:19,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 04:38:19,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 04:38:19,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 04:38:19,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 04:38:19,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:38:18" (1/3) ... [2022-10-16 04:38:19,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c50895b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:38:19, skipping insertion in model container [2022-10-16 04:38:19,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:38:19" (2/3) ... [2022-10-16 04:38:19,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c50895b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:38:19, skipping insertion in model container [2022-10-16 04:38:19,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:38:19" (3/3) ... [2022-10-16 04:38:19,819 INFO L112 eAbstractionObserver]: Analyzing ICFG NoriSharma-2013FSE-Fig8-alloca.i [2022-10-16 04:38:19,843 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 04:38:19,843 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-10-16 04:38:19,907 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 04:38:19,917 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;@f1fc11a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 04:38:19,917 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2022-10-16 04:38:19,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 33 states have (on average 2.272727272727273) internal successors, (75), 72 states have internal predecessors, (75), 0 states have call successors, (0), 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-16 04:38:19,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-16 04:38:19,931 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:19,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-16 04:38:19,933 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-10-16 04:38:19,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:19,940 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-10-16 04:38:19,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:19,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795650253] [2022-10-16 04:38:19,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:19,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:21,197 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-16 04:38:21,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:21,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795650253] [2022-10-16 04:38:21,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795650253] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:21,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:21,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:21,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356363757] [2022-10-16 04:38:21,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:21,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:21,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:21,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:21,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:21,269 INFO L87 Difference]: Start difference. First operand has 73 states, 33 states have (on average 2.272727272727273) internal successors, (75), 72 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:21,456 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-10-16 04:38:21,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:21,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-10-16 04:38:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:21,471 INFO L225 Difference]: With dead ends: 69 [2022-10-16 04:38:21,472 INFO L226 Difference]: Without dead ends: 67 [2022-10-16 04:38:21,475 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-16 04:38:21,482 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 64 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:21,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 32 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 04:38:21,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-10-16 04:38:21,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-10-16 04:38:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 32 states have (on average 2.125) internal successors, (68), 66 states have internal predecessors, (68), 0 states have call successors, (0), 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-16 04:38:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-10-16 04:38:21,546 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 3 [2022-10-16 04:38:21,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:21,546 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-10-16 04:38:21,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:21,547 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-10-16 04:38:21,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-16 04:38:21,548 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:21,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-16 04:38:21,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 04:38:21,549 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-10-16 04:38:21,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:21,551 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-10-16 04:38:21,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:21,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553631362] [2022-10-16 04:38:21,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:21,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:21,910 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-16 04:38:21,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:21,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553631362] [2022-10-16 04:38:21,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553631362] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:21,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:21,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:21,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508485926] [2022-10-16 04:38:21,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:21,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:21,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:21,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:21,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:21,915 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:21,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:21,973 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2022-10-16 04:38:21,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:21,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-10-16 04:38:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:21,975 INFO L225 Difference]: With dead ends: 63 [2022-10-16 04:38:21,975 INFO L226 Difference]: Without dead ends: 63 [2022-10-16 04:38:21,976 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-16 04:38:21,978 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 62 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:21,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 31 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-10-16 04:38:21,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-10-16 04:38:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 32 states have (on average 2.0) internal successors, (64), 62 states have internal predecessors, (64), 0 states have call successors, (0), 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-16 04:38:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-10-16 04:38:21,989 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 3 [2022-10-16 04:38:21,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:21,989 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-10-16 04:38:21,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:21,990 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-10-16 04:38:21,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-16 04:38:21,990 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:21,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-16 04:38:21,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 04:38:21,991 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-10-16 04:38:21,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:21,992 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2022-10-16 04:38:21,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:21,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395999858] [2022-10-16 04:38:21,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:21,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:22,669 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-16 04:38:22,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:22,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395999858] [2022-10-16 04:38:22,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395999858] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:22,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:22,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 04:38:22,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497986751] [2022-10-16 04:38:22,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:22,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 04:38:22,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:22,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 04:38:22,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 04:38:22,685 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-16 04:38:22,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:22,791 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-10-16 04:38:22,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:22,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-16 04:38:22,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:22,793 INFO L225 Difference]: With dead ends: 62 [2022-10-16 04:38:22,793 INFO L226 Difference]: Without dead ends: 62 [2022-10-16 04:38:22,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 04:38:22,795 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 117 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:22,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 28 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 04:38:22,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-10-16 04:38:22,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-10-16 04:38:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 32 states have (on average 1.96875) internal successors, (63), 61 states have internal predecessors, (63), 0 states have call successors, (0), 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-16 04:38:22,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2022-10-16 04:38:22,803 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 4 [2022-10-16 04:38:22,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:22,804 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2022-10-16 04:38:22,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-16 04:38:22,804 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2022-10-16 04:38:22,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-16 04:38:22,805 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:22,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-16 04:38:22,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 04:38:22,805 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-10-16 04:38:22,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:22,806 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2022-10-16 04:38:22,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:22,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78787763] [2022-10-16 04:38:22,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:22,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:23,240 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-16 04:38:23,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:23,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78787763] [2022-10-16 04:38:23,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78787763] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:23,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:23,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:23,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492043946] [2022-10-16 04:38:23,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:23,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:23,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:23,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:23,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:23,250 INFO L87 Difference]: Start difference. First operand 62 states and 63 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-16 04:38:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:23,323 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-10-16 04:38:23,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:23,323 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-16 04:38:23,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:23,324 INFO L225 Difference]: With dead ends: 61 [2022-10-16 04:38:23,325 INFO L226 Difference]: Without dead ends: 61 [2022-10-16 04:38:23,325 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-16 04:38:23,327 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 59 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:23,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 30 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 04:38:23,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-10-16 04:38:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-10-16 04:38:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 32 states have (on average 1.9375) internal successors, (62), 60 states have internal predecessors, (62), 0 states have call successors, (0), 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-16 04:38:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-10-16 04:38:23,334 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 4 [2022-10-16 04:38:23,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:23,335 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-10-16 04:38:23,335 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-16 04:38:23,335 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-10-16 04:38:23,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 04:38:23,336 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:23,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 04:38:23,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 04:38:23,336 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-10-16 04:38:23,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:23,337 INFO L85 PathProgramCache]: Analyzing trace with hash 889446152, now seen corresponding path program 1 times [2022-10-16 04:38:23,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:23,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677227346] [2022-10-16 04:38:23,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:23,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:23,512 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-16 04:38:23,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:23,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677227346] [2022-10-16 04:38:23,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677227346] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:23,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:23,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:23,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589928377] [2022-10-16 04:38:23,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:23,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:23,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:23,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:23,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:23,517 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:23,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:23,586 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-10-16 04:38:23,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:23,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-16 04:38:23,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:23,587 INFO L225 Difference]: With dead ends: 57 [2022-10-16 04:38:23,587 INFO L226 Difference]: Without dead ends: 57 [2022-10-16 04:38:23,588 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-16 04:38:23,589 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:23,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 24 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 04:38:23,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-10-16 04:38:23,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-10-16 04:38:23,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.8125) internal successors, (58), 56 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:23,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2022-10-16 04:38:23,596 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 6 [2022-10-16 04:38:23,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:23,597 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2022-10-16 04:38:23,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:23,597 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-10-16 04:38:23,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 04:38:23,598 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:23,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 04:38:23,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 04:38:23,598 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-10-16 04:38:23,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:23,599 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2022-10-16 04:38:23,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:23,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356367422] [2022-10-16 04:38:23,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:23,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:23,817 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-16 04:38:23,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:23,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356367422] [2022-10-16 04:38:23,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356367422] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:23,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:23,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:23,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604921563] [2022-10-16 04:38:23,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:23,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:23,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:23,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:23,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:23,823 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:23,873 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-10-16 04:38:23,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:23,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-16 04:38:23,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:23,874 INFO L225 Difference]: With dead ends: 53 [2022-10-16 04:38:23,874 INFO L226 Difference]: Without dead ends: 53 [2022-10-16 04:38:23,875 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-16 04:38:23,876 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 49 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:23,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 26 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:23,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-10-16 04:38:23,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-10-16 04:38:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.6875) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 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-16 04:38:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2022-10-16 04:38:23,882 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 6 [2022-10-16 04:38:23,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:23,883 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2022-10-16 04:38:23,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:23,883 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-10-16 04:38:23,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 04:38:23,884 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:23,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:23,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 04:38:23,884 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-10-16 04:38:23,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:23,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026919, now seen corresponding path program 1 times [2022-10-16 04:38:23,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:23,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357291523] [2022-10-16 04:38:23,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:23,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:24,370 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-16 04:38:24,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:24,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357291523] [2022-10-16 04:38:24,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357291523] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:24,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:24,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 04:38:24,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516872930] [2022-10-16 04:38:24,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:24,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 04:38:24,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:24,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 04:38:24,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 04:38:24,374 INFO L87 Difference]: Start difference. First operand 53 states and 54 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-16 04:38:24,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:24,480 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-10-16 04:38:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:24,481 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-16 04:38:24,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:24,482 INFO L225 Difference]: With dead ends: 52 [2022-10-16 04:38:24,482 INFO L226 Difference]: Without dead ends: 52 [2022-10-16 04:38:24,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 04:38:24,485 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:24,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 23 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 04:38:24,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-10-16 04:38:24,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-10-16 04:38:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.65625) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 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-16 04:38:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2022-10-16 04:38:24,495 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 7 [2022-10-16 04:38:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:24,499 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2022-10-16 04:38:24,499 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-16 04:38:24,499 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2022-10-16 04:38:24,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 04:38:24,500 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:24,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:24,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 04:38:24,503 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-10-16 04:38:24,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:24,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026920, now seen corresponding path program 1 times [2022-10-16 04:38:24,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:24,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619148094] [2022-10-16 04:38:24,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:24,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:24,823 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-16 04:38:24,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:24,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619148094] [2022-10-16 04:38:24,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619148094] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:24,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:24,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:24,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551146461] [2022-10-16 04:38:24,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:24,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:24,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:24,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:24,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:24,827 INFO L87 Difference]: Start difference. First operand 52 states and 53 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-16 04:38:24,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:24,867 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2022-10-16 04:38:24,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:24,868 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-16 04:38:24,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:24,868 INFO L225 Difference]: With dead ends: 51 [2022-10-16 04:38:24,868 INFO L226 Difference]: Without dead ends: 51 [2022-10-16 04:38:24,869 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-16 04:38:24,871 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:24,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 25 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-10-16 04:38:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-10-16 04:38:24,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.625) internal successors, (52), 50 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-16 04:38:24,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-10-16 04:38:24,880 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 7 [2022-10-16 04:38:24,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:24,880 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-10-16 04:38:24,881 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-16 04:38:24,881 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-10-16 04:38:24,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 04:38:24,882 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:24,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:24,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 04:38:24,884 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-10-16 04:38:24,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:24,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1837048424, now seen corresponding path program 1 times [2022-10-16 04:38:24,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:24,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066311782] [2022-10-16 04:38:24,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:24,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:25,046 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-16 04:38:25,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:25,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066311782] [2022-10-16 04:38:25,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066311782] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:25,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:25,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:25,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489665136] [2022-10-16 04:38:25,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:25,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:25,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:25,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:25,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:25,049 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-16 04:38:25,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:25,100 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-10-16 04:38:25,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:25,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-16 04:38:25,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:25,101 INFO L225 Difference]: With dead ends: 46 [2022-10-16 04:38:25,101 INFO L226 Difference]: Without dead ends: 46 [2022-10-16 04:38:25,102 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-16 04:38:25,103 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:25,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 18 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:25,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-16 04:38:25,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-10-16 04:38:25,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.46875) internal successors, (47), 45 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2022-10-16 04:38:25,108 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 9 [2022-10-16 04:38:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:25,108 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2022-10-16 04:38:25,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-16 04:38:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2022-10-16 04:38:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 04:38:25,109 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:25,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:25,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 04:38:25,110 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-10-16 04:38:25,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:25,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1837048425, now seen corresponding path program 1 times [2022-10-16 04:38:25,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:25,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767379965] [2022-10-16 04:38:25,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:25,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:25,268 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-16 04:38:25,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:25,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767379965] [2022-10-16 04:38:25,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767379965] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:25,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:25,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:25,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985906778] [2022-10-16 04:38:25,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:25,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:25,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:25,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:25,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:25,271 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-16 04:38:25,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:25,311 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-10-16 04:38:25,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:25,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-16 04:38:25,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:25,313 INFO L225 Difference]: With dead ends: 41 [2022-10-16 04:38:25,313 INFO L226 Difference]: Without dead ends: 41 [2022-10-16 04:38:25,314 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-16 04:38:25,315 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 34 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:25,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 20 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:25,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-10-16 04:38:25,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-10-16 04:38:25,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.3125) internal successors, (42), 40 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-16 04:38:25,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2022-10-16 04:38:25,319 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 9 [2022-10-16 04:38:25,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:25,320 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2022-10-16 04:38:25,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-16 04:38:25,320 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-10-16 04:38:25,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 04:38:25,321 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:25,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:25,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 04:38:25,322 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-10-16 04:38:25,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:25,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1113926286, now seen corresponding path program 1 times [2022-10-16 04:38:25,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:25,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441471075] [2022-10-16 04:38:25,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:25,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:38:25,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:25,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441471075] [2022-10-16 04:38:25,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441471075] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:25,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:25,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 04:38:25,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577630135] [2022-10-16 04:38:25,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:25,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 04:38:25,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:25,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 04:38:25,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 04:38:25,481 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:25,523 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-10-16 04:38:25,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:25,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-16 04:38:25,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:25,524 INFO L225 Difference]: With dead ends: 40 [2022-10-16 04:38:25,524 INFO L226 Difference]: Without dead ends: 40 [2022-10-16 04:38:25,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 04:38:25,526 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 67 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:25,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 17 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:25,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-10-16 04:38:25,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-10-16 04:38:25,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 39 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-16 04:38:25,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2022-10-16 04:38:25,530 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 10 [2022-10-16 04:38:25,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:25,530 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2022-10-16 04:38:25,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:25,530 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-10-16 04:38:25,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 04:38:25,531 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:25,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:25,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 04:38:25,532 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-10-16 04:38:25,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:25,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1113926287, now seen corresponding path program 1 times [2022-10-16 04:38:25,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:25,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377285372] [2022-10-16 04:38:25,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:25,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:25,732 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-16 04:38:25,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:25,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377285372] [2022-10-16 04:38:25,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377285372] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:25,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:25,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:25,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150457322] [2022-10-16 04:38:25,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:25,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:25,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:25,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:25,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:25,747 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:25,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:25,778 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-10-16 04:38:25,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:25,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-16 04:38:25,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:25,779 INFO L225 Difference]: With dead ends: 39 [2022-10-16 04:38:25,780 INFO L226 Difference]: Without dead ends: 39 [2022-10-16 04:38:25,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:25,781 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:25,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 19 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:25,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-10-16 04:38:25,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-10-16 04:38:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.25) internal successors, (40), 38 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-10-16 04:38:25,785 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 10 [2022-10-16 04:38:25,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:25,785 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-10-16 04:38:25,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-10-16 04:38:25,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 04:38:25,786 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:25,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:25,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 04:38:25,787 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-10-16 04:38:25,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:25,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1036303919, now seen corresponding path program 1 times [2022-10-16 04:38:25,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:25,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503219835] [2022-10-16 04:38:25,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:25,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:25,893 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-16 04:38:25,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:25,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503219835] [2022-10-16 04:38:25,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503219835] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:25,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:25,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:25,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508319299] [2022-10-16 04:38:25,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:25,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:25,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:25,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:25,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:25,896 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:25,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:25,932 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-10-16 04:38:25,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:25,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-16 04:38:25,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:25,933 INFO L225 Difference]: With dead ends: 36 [2022-10-16 04:38:25,933 INFO L226 Difference]: Without dead ends: 36 [2022-10-16 04:38:25,934 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-16 04:38:25,935 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:25,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 14 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:25,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-16 04:38:25,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-10-16 04:38:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.15625) internal successors, (37), 35 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-16 04:38:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-10-16 04:38:25,938 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 12 [2022-10-16 04:38:25,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:25,939 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-10-16 04:38:25,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-10-16 04:38:25,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 04:38:25,940 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:25,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:25,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 04:38:25,940 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-10-16 04:38:25,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:25,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1036303920, now seen corresponding path program 1 times [2022-10-16 04:38:25,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:25,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111977938] [2022-10-16 04:38:25,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:25,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:26,058 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-16 04:38:26,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:26,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111977938] [2022-10-16 04:38:26,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111977938] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:26,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:26,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:38:26,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436712965] [2022-10-16 04:38:26,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:26,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:38:26,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:26,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:38:26,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:38:26,061 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:26,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:26,091 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-10-16 04:38:26,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:38:26,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-16 04:38:26,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:26,092 INFO L225 Difference]: With dead ends: 33 [2022-10-16 04:38:26,092 INFO L226 Difference]: Without dead ends: 33 [2022-10-16 04:38:26,092 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-16 04:38:26,093 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:26,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 16 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:38:26,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-10-16 04:38:26,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-10-16 04:38:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.0625) internal successors, (34), 32 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-16 04:38:26,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-10-16 04:38:26,097 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 12 [2022-10-16 04:38:26,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:26,098 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-10-16 04:38:26,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-10-16 04:38:26,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 04:38:26,099 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:38:26,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:26,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 04:38:26,099 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-10-16 04:38:26,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:38:26,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1170594008, now seen corresponding path program 1 times [2022-10-16 04:38:26,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:38:26,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141166509] [2022-10-16 04:38:26,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:38:26,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:38:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:38:30,502 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-16 04:38:30,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:38:30,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141166509] [2022-10-16 04:38:30,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141166509] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:38:30,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:38:30,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-16 04:38:30,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40199753] [2022-10-16 04:38:30,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:38:30,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-16 04:38:30,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:38:30,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-16 04:38:30,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-10-16 04:38:30,505 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:30,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:38:30,728 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-10-16 04:38:30,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 04:38:30,729 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-16 04:38:30,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:38:30,729 INFO L225 Difference]: With dead ends: 32 [2022-10-16 04:38:30,730 INFO L226 Difference]: Without dead ends: 0 [2022-10-16 04:38:30,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-10-16 04:38:30,731 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 120 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 04:38:30,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 24 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 04:38:30,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-16 04:38:30,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-16 04:38:30,736 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-16 04:38:30,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-16 04:38:30,736 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-10-16 04:38:30,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:38:30,737 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-16 04:38:30,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:38:30,737 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-16 04:38:30,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-16 04:38:30,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 39 remaining) [2022-10-16 04:38:30,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 39 remaining) [2022-10-16 04:38:30,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 39 remaining) [2022-10-16 04:38:30,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 39 remaining) [2022-10-16 04:38:30,744 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 39 remaining) [2022-10-16 04:38:30,744 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 39 remaining) [2022-10-16 04:38:30,744 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 39 remaining) [2022-10-16 04:38:30,744 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 39 remaining) [2022-10-16 04:38:30,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 39 remaining) [2022-10-16 04:38:30,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 39 remaining) [2022-10-16 04:38:30,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 39 remaining) [2022-10-16 04:38:30,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 39 remaining) [2022-10-16 04:38:30,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 39 remaining) [2022-10-16 04:38:30,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 39 remaining) [2022-10-16 04:38:30,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 39 remaining) [2022-10-16 04:38:30,748 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 39 remaining) [2022-10-16 04:38:30,748 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 39 remaining) [2022-10-16 04:38:30,748 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 39 remaining) [2022-10-16 04:38:30,749 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 39 remaining) [2022-10-16 04:38:30,749 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 39 remaining) [2022-10-16 04:38:30,749 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 39 remaining) [2022-10-16 04:38:30,749 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 39 remaining) [2022-10-16 04:38:30,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 39 remaining) [2022-10-16 04:38:30,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 39 remaining) [2022-10-16 04:38:30,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 39 remaining) [2022-10-16 04:38:30,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 39 remaining) [2022-10-16 04:38:30,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 39 remaining) [2022-10-16 04:38:30,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 39 remaining) [2022-10-16 04:38:30,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 39 remaining) [2022-10-16 04:38:30,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 39 remaining) [2022-10-16 04:38:30,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 39 remaining) [2022-10-16 04:38:30,752 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 39 remaining) [2022-10-16 04:38:30,752 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 39 remaining) [2022-10-16 04:38:30,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 39 remaining) [2022-10-16 04:38:30,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 39 remaining) [2022-10-16 04:38:30,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 39 remaining) [2022-10-16 04:38:30,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 39 remaining) [2022-10-16 04:38:30,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 39 remaining) [2022-10-16 04:38:30,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK (0 of 39 remaining) [2022-10-16 04:38:30,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-16 04:38:30,760 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:38:30,764 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 04:38:30,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:38:30 BoogieIcfgContainer [2022-10-16 04:38:30,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 04:38:30,780 INFO L158 Benchmark]: Toolchain (without parser) took 12248.34ms. Allocated memory was 151.0MB in the beginning and 263.2MB in the end (delta: 112.2MB). Free memory was 125.5MB in the beginning and 220.5MB in the end (delta: -95.0MB). Peak memory consumption was 17.6MB. Max. memory is 8.0GB. [2022-10-16 04:38:30,781 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 151.0MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 04:38:30,782 INFO L158 Benchmark]: CACSL2BoogieTranslator took 523.41ms. Allocated memory is still 151.0MB. Free memory was 125.3MB in the beginning and 110.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-10-16 04:38:30,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.42ms. Allocated memory is still 151.0MB. Free memory was 110.2MB in the beginning and 108.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 04:38:30,783 INFO L158 Benchmark]: Boogie Preprocessor took 33.59ms. Allocated memory is still 151.0MB. Free memory was 108.2MB in the beginning and 106.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 04:38:30,783 INFO L158 Benchmark]: RCFGBuilder took 625.66ms. Allocated memory is still 151.0MB. Free memory was 106.8MB in the beginning and 122.3MB in the end (delta: -15.5MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-10-16 04:38:30,784 INFO L158 Benchmark]: TraceAbstraction took 10969.32ms. Allocated memory was 151.0MB in the beginning and 263.2MB in the end (delta: 112.2MB). Free memory was 121.7MB in the beginning and 220.5MB in the end (delta: -98.7MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2022-10-16 04:38:30,790 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 151.0MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 523.41ms. Allocated memory is still 151.0MB. Free memory was 125.3MB in the beginning and 110.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 80.42ms. Allocated memory is still 151.0MB. Free memory was 110.2MB in the beginning and 108.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.59ms. Allocated memory is still 151.0MB. Free memory was 108.2MB in the beginning and 106.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 625.66ms. Allocated memory is still 151.0MB. Free memory was 106.8MB in the beginning and 122.3MB in the end (delta: -15.5MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * TraceAbstraction took 10969.32ms. Allocated memory was 151.0MB in the beginning and 263.2MB in the end (delta: 112.2MB). Free memory was 121.7MB in the beginning and 220.5MB in the end (delta: -98.7MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: 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, 73 locations, 39 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 833 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 833 mSDsluCounter, 347 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 480 IncrementalHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 328 mSDtfsCounter, 480 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=0, InterpolantAutomatonStates: 46, 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, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 2689 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 39 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-10-16 04:38:30,864 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...