/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/ldv-regression/test30-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 01:34:13,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 01:34:13,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 01:34:13,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 01:34:13,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 01:34:13,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 01:34:13,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 01:34:13,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 01:34:13,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 01:34:13,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 01:34:13,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 01:34:13,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 01:34:13,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 01:34:13,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 01:34:13,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 01:34:13,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 01:34:13,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 01:34:13,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 01:34:13,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 01:34:13,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 01:34:13,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 01:34:13,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 01:34:13,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 01:34:13,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 01:34:13,975 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 01:34:13,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 01:34:13,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 01:34:13,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 01:34:13,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 01:34:13,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 01:34:13,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 01:34:13,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 01:34:13,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 01:34:13,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 01:34:13,984 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 01:34:13,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 01:34:13,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 01:34:13,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 01:34:13,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 01:34:13,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 01:34:13,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 01:34:13,989 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 01:34:14,029 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 01:34:14,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 01:34:14,031 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 01:34:14,031 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 01:34:14,034 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 01:34:14,034 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 01:34:14,036 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 01:34:14,037 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 01:34:14,037 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 01:34:14,037 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 01:34:14,038 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 01:34:14,038 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 01:34:14,039 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 01:34:14,039 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 01:34:14,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 01:34:14,039 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-16 01:34:14,039 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-16 01:34:14,040 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-16 01:34:14,040 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 01:34:14,040 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-16 01:34:14,040 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 01:34:14,040 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 01:34:14,041 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 01:34:14,041 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 01:34:14,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 01:34:14,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 01:34:14,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 01:34:14,042 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 01:34:14,042 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 01:34:14,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 01:34:14,042 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 01:34:14,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 01:34:14,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 01:34:14,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 01:34:14,495 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 01:34:14,496 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 01:34:14,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test30-2.c [2022-10-16 01:34:14,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd8efb271/b56bf2f7d97b4cafbacc5b94824560bc/FLAGf891faff1 [2022-10-16 01:34:15,190 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 01:34:15,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test30-2.c [2022-10-16 01:34:15,199 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd8efb271/b56bf2f7d97b4cafbacc5b94824560bc/FLAGf891faff1 [2022-10-16 01:34:15,514 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd8efb271/b56bf2f7d97b4cafbacc5b94824560bc [2022-10-16 01:34:15,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 01:34:15,527 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 01:34:15,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 01:34:15,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 01:34:15,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 01:34:15,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:34:15" (1/1) ... [2022-10-16 01:34:15,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c65f073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:15, skipping insertion in model container [2022-10-16 01:34:15,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:34:15" (1/1) ... [2022-10-16 01:34:15,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 01:34:15,566 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 01:34:15,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test30-2.c[560,573] [2022-10-16 01:34:15,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 01:34:15,744 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 01:34:15,761 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test30-2.c[560,573] [2022-10-16 01:34:15,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 01:34:15,780 INFO L208 MainTranslator]: Completed translation [2022-10-16 01:34:15,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:15 WrapperNode [2022-10-16 01:34:15,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 01:34:15,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 01:34:15,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 01:34:15,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 01:34:15,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:15" (1/1) ... [2022-10-16 01:34:15,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:15" (1/1) ... [2022-10-16 01:34:15,825 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 49 [2022-10-16 01:34:15,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 01:34:15,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 01:34:15,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 01:34:15,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 01:34:15,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:15" (1/1) ... [2022-10-16 01:34:15,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:15" (1/1) ... [2022-10-16 01:34:15,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:15" (1/1) ... [2022-10-16 01:34:15,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:15" (1/1) ... [2022-10-16 01:34:15,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:15" (1/1) ... [2022-10-16 01:34:15,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:15" (1/1) ... [2022-10-16 01:34:15,851 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:15" (1/1) ... [2022-10-16 01:34:15,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:15" (1/1) ... [2022-10-16 01:34:15,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 01:34:15,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 01:34:15,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 01:34:15,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 01:34:15,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:15" (1/1) ... [2022-10-16 01:34:15,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 01:34:15,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:34:15,899 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 01:34:15,917 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 01:34:15,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 01:34:15,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-16 01:34:15,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 01:34:15,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 01:34:15,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 01:34:15,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 01:34:15,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 01:34:15,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 01:34:16,093 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 01:34:16,096 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 01:34:16,374 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 01:34:16,382 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 01:34:16,383 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-16 01:34:16,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:34:16 BoogieIcfgContainer [2022-10-16 01:34:16,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 01:34:16,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 01:34:16,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 01:34:16,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 01:34:16,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:34:15" (1/3) ... [2022-10-16 01:34:16,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702b56c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:34:16, skipping insertion in model container [2022-10-16 01:34:16,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:34:15" (2/3) ... [2022-10-16 01:34:16,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702b56c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:34:16, skipping insertion in model container [2022-10-16 01:34:16,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:34:16" (3/3) ... [2022-10-16 01:34:16,396 INFO L112 eAbstractionObserver]: Analyzing ICFG test30-2.c [2022-10-16 01:34:16,422 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 01:34:16,423 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-10-16 01:34:16,580 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 01:34:16,604 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;@1d3e9452, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 01:34:16,606 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-10-16 01:34:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 16 states have (on average 1.9375) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:34:16,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-16 01:34:16,641 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:34:16,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-16 01:34:16,643 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:34:16,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:34:16,659 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-10-16 01:34:16,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:34:16,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259112792] [2022-10-16 01:34:16,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:34:16,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:34:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:34:17,112 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 01:34:17,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:34:17,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259112792] [2022-10-16 01:34:17,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259112792] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:34:17,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:34:17,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:34:17,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218599743] [2022-10-16 01:34:17,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:34:17,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 01:34:17,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:34:17,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 01:34:17,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 01:34:17,180 INFO L87 Difference]: Start difference. First operand has 31 states, 16 states have (on average 1.9375) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) 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 01:34:17,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:34:17,297 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2022-10-16 01:34:17,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 01:34:17,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) 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 01:34:17,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:34:17,312 INFO L225 Difference]: With dead ends: 29 [2022-10-16 01:34:17,312 INFO L226 Difference]: Without dead ends: 27 [2022-10-16 01:34:17,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 01:34:17,319 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:34:17,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 13 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:34:17,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-10-16 01:34:17,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-10-16 01:34:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 26 states have internal predecessors, (26), 0 states have call successors, (0), 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 01:34:17,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2022-10-16 01:34:17,358 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 3 [2022-10-16 01:34:17,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:34:17,358 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2022-10-16 01:34:17,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) 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 01:34:17,359 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2022-10-16 01:34:17,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-16 01:34:17,359 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:34:17,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-16 01:34:17,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 01:34:17,361 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:34:17,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:34:17,362 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-10-16 01:34:17,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:34:17,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477925758] [2022-10-16 01:34:17,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:34:17,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:34:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:34:17,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:34:17,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:34:17,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477925758] [2022-10-16 01:34:17,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477925758] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:34:17,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:34:17,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:34:17,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613501225] [2022-10-16 01:34:17,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:34:17,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 01:34:17,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:34:17,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 01:34:17,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 01:34:17,671 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand has 4 states, 3 states have (on average 1.0) 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 01:34:17,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:34:17,728 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2022-10-16 01:34:17,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 01:34:17,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) 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 01:34:17,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:34:17,730 INFO L225 Difference]: With dead ends: 25 [2022-10-16 01:34:17,730 INFO L226 Difference]: Without dead ends: 25 [2022-10-16 01:34:17,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 01:34:17,733 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:34:17,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 13 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:34:17,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-10-16 01:34:17,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-10-16 01:34:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.6) internal successors, (24), 24 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:34:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2022-10-16 01:34:17,741 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 3 [2022-10-16 01:34:17,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:34:17,741 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2022-10-16 01:34:17,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) 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 01:34:17,742 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2022-10-16 01:34:17,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 01:34:17,742 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:34:17,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 01:34:17,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 01:34:17,743 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:34:17,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:34:17,745 INFO L85 PathProgramCache]: Analyzing trace with hash 889446152, now seen corresponding path program 1 times [2022-10-16 01:34:17,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:34:17,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68424485] [2022-10-16 01:34:17,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:34:17,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:34:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:34:17,998 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 01:34:17,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:34:17,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68424485] [2022-10-16 01:34:18,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68424485] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:34:18,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:34:18,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 01:34:18,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804013545] [2022-10-16 01:34:18,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:34:18,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 01:34:18,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:34:18,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 01:34:18,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 01:34:18,004 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:34:18,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:34:18,143 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2022-10-16 01:34:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 01:34:18,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-16 01:34:18,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:34:18,145 INFO L225 Difference]: With dead ends: 24 [2022-10-16 01:34:18,145 INFO L226 Difference]: Without dead ends: 24 [2022-10-16 01:34:18,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-10-16 01:34:18,148 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:34:18,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 32 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:34:18,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-10-16 01:34:18,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-10-16 01:34:18,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 23 states have internal predecessors, (23), 0 states have call successors, (0), 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 01:34:18,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2022-10-16 01:34:18,155 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 6 [2022-10-16 01:34:18,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:34:18,155 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2022-10-16 01:34:18,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:34:18,156 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2022-10-16 01:34:18,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 01:34:18,156 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:34:18,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 01:34:18,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 01:34:18,157 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:34:18,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:34:18,159 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2022-10-16 01:34:18,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:34:18,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031885273] [2022-10-16 01:34:18,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:34:18,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:34:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:34:18,472 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 01:34:18,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:34:18,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031885273] [2022-10-16 01:34:18,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031885273] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:34:18,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:34:18,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 01:34:18,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966167434] [2022-10-16 01:34:18,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:34:18,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 01:34:18,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:34:18,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 01:34:18,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 01:34:18,477 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:34:18,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:34:18,611 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2022-10-16 01:34:18,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 01:34:18,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-16 01:34:18,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:34:18,613 INFO L225 Difference]: With dead ends: 23 [2022-10-16 01:34:18,613 INFO L226 Difference]: Without dead ends: 23 [2022-10-16 01:34:18,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-10-16 01:34:18,615 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:34:18,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 36 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:34:18,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-10-16 01:34:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-10-16 01:34:18,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 22 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:34:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2022-10-16 01:34:18,621 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 6 [2022-10-16 01:34:18,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:34:18,622 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2022-10-16 01:34:18,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:34:18,622 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2022-10-16 01:34:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 01:34:18,623 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:34:18,623 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:34:18,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 01:34:18,624 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:34:18,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:34:18,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026919, now seen corresponding path program 1 times [2022-10-16 01:34:18,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:34:18,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096470034] [2022-10-16 01:34:18,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:34:18,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:34:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:34:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:34:18,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:34:18,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096470034] [2022-10-16 01:34:18,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096470034] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:34:18,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:34:18,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 01:34:18,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323049207] [2022-10-16 01:34:18,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:34:18,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 01:34:18,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:34:18,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 01:34:18,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 01:34:18,712 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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 01:34:18,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:34:18,795 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2022-10-16 01:34:18,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 01:34:18,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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 01:34:18,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:34:18,797 INFO L225 Difference]: With dead ends: 22 [2022-10-16 01:34:18,798 INFO L226 Difference]: Without dead ends: 22 [2022-10-16 01:34:18,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-10-16 01:34:18,800 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:34:18,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 28 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:34:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-10-16 01:34:18,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-10-16 01:34:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.4) internal successors, (21), 21 states have internal predecessors, (21), 0 states have call successors, (0), 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 01:34:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2022-10-16 01:34:18,806 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 7 [2022-10-16 01:34:18,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:34:18,806 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2022-10-16 01:34:18,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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 01:34:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2022-10-16 01:34:18,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 01:34:18,807 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:34:18,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:34:18,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 01:34:18,808 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:34:18,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:34:18,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026920, now seen corresponding path program 1 times [2022-10-16 01:34:18,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:34:18,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251618632] [2022-10-16 01:34:18,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:34:18,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:34:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:34:18,959 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 01:34:18,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:34:18,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251618632] [2022-10-16 01:34:18,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251618632] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:34:18,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:34:18,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 01:34:18,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599011620] [2022-10-16 01:34:18,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:34:18,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 01:34:18,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:34:18,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 01:34:18,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 01:34:18,963 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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 01:34:19,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:34:19,080 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-10-16 01:34:19,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 01:34:19,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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 01:34:19,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:34:19,082 INFO L225 Difference]: With dead ends: 21 [2022-10-16 01:34:19,082 INFO L226 Difference]: Without dead ends: 21 [2022-10-16 01:34:19,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-10-16 01:34:19,084 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 33 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:34:19,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 30 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:34:19,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-10-16 01:34:19,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-10-16 01:34:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 20 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:34:19,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2022-10-16 01:34:19,088 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 7 [2022-10-16 01:34:19,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:34:19,089 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2022-10-16 01:34:19,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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 01:34:19,089 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2022-10-16 01:34:19,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 01:34:19,090 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:34:19,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:34:19,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 01:34:19,090 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:34:19,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:34:19,091 INFO L85 PathProgramCache]: Analyzing trace with hash 171977450, now seen corresponding path program 1 times [2022-10-16 01:34:19,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:34:19,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777053713] [2022-10-16 01:34:19,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:34:19,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:34:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:34:19,155 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 01:34:19,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:34:19,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777053713] [2022-10-16 01:34:19,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777053713] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:34:19,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:34:19,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-16 01:34:19,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489694501] [2022-10-16 01:34:19,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:34:19,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:34:19,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:34:19,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:34:19,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:34:19,159 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:34:19,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:34:19,175 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2022-10-16 01:34:19,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:34:19,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-16 01:34:19,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:34:19,176 INFO L225 Difference]: With dead ends: 20 [2022-10-16 01:34:19,176 INFO L226 Difference]: Without dead ends: 20 [2022-10-16 01:34:19,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 01:34:19,178 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:34:19,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 9 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:34:19,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-10-16 01:34:19,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-10-16 01:34:19,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 19 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:34:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2022-10-16 01:34:19,182 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 11 [2022-10-16 01:34:19,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:34:19,182 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2022-10-16 01:34:19,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:34:19,183 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2022-10-16 01:34:19,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 01:34:19,184 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:34:19,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:34:19,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 01:34:19,184 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:34:19,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:34:19,185 INFO L85 PathProgramCache]: Analyzing trace with hash 171977451, now seen corresponding path program 1 times [2022-10-16 01:34:19,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:34:19,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727026510] [2022-10-16 01:34:19,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:34:19,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:34:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:34:19,274 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 01:34:19,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:34:19,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727026510] [2022-10-16 01:34:19,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727026510] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:34:19,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:34:19,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-16 01:34:19,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700393374] [2022-10-16 01:34:19,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:34:19,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:34:19,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:34:19,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:34:19,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:34:19,277 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:34:19,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:34:19,289 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2022-10-16 01:34:19,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:34:19,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-16 01:34:19,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:34:19,290 INFO L225 Difference]: With dead ends: 19 [2022-10-16 01:34:19,290 INFO L226 Difference]: Without dead ends: 19 [2022-10-16 01:34:19,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 01:34:19,292 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:34:19,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:34:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-10-16 01:34:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-10-16 01:34:19,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 18 states have internal predecessors, (18), 0 states have call successors, (0), 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 01:34:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2022-10-16 01:34:19,296 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 11 [2022-10-16 01:34:19,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:34:19,296 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2022-10-16 01:34:19,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:34:19,297 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2022-10-16 01:34:19,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 01:34:19,297 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:34:19,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:34:19,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 01:34:19,298 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:34:19,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:34:19,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1036333648, now seen corresponding path program 1 times [2022-10-16 01:34:19,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:34:19,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599340638] [2022-10-16 01:34:19,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:34:19,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:34:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:34:19,388 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 01:34:19,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:34:19,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599340638] [2022-10-16 01:34:19,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599340638] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:34:19,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:34:19,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-16 01:34:19,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777431036] [2022-10-16 01:34:19,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:34:19,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:34:19,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:34:19,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:34:19,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:34:19,391 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 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 01:34:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:34:19,407 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2022-10-16 01:34:19,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:34:19,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 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 01:34:19,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:34:19,408 INFO L225 Difference]: With dead ends: 18 [2022-10-16 01:34:19,408 INFO L226 Difference]: Without dead ends: 18 [2022-10-16 01:34:19,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 01:34:19,409 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:34:19,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:34:19,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-10-16 01:34:19,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-10-16 01:34:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 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 01:34:19,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2022-10-16 01:34:19,413 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 12 [2022-10-16 01:34:19,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:34:19,414 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2022-10-16 01:34:19,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 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 01:34:19,414 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2022-10-16 01:34:19,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 01:34:19,415 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:34:19,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:34:19,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 01:34:19,415 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:34:19,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:34:19,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1036333649, now seen corresponding path program 1 times [2022-10-16 01:34:19,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:34:19,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846413443] [2022-10-16 01:34:19,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:34:19,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:34:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:34:19,758 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 01:34:19,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:34:19,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846413443] [2022-10-16 01:34:19,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846413443] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:34:19,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:34:19,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 01:34:19,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652480310] [2022-10-16 01:34:19,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:34:19,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-16 01:34:19,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:34:19,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-16 01:34:19,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-10-16 01:34:19,761 INFO L87 Difference]: Start difference. First operand 18 states and 17 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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 01:34:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:34:19,944 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2022-10-16 01:34:19,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 01:34:19,945 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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 01:34:19,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:34:19,945 INFO L225 Difference]: With dead ends: 17 [2022-10-16 01:34:19,945 INFO L226 Difference]: Without dead ends: 17 [2022-10-16 01:34:19,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-10-16 01:34:19,948 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 41 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:34:19,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 33 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:34:19,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-10-16 01:34:19,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-10-16 01:34:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 0 states have call successors, (0), 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 01:34:19,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2022-10-16 01:34:19,954 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 12 [2022-10-16 01:34:19,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:34:19,955 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2022-10-16 01:34:19,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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 01:34:19,955 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2022-10-16 01:34:19,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 01:34:19,956 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:34:19,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:34:19,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 01:34:19,957 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:34:19,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:34:19,958 INFO L85 PathProgramCache]: Analyzing trace with hash -515776973, now seen corresponding path program 1 times [2022-10-16 01:34:19,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:34:19,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191192481] [2022-10-16 01:34:19,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:34:19,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:34:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 01:34:19,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 01:34:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 01:34:20,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 01:34:20,071 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 01:34:20,073 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (13 of 14 remaining) [2022-10-16 01:34:20,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2022-10-16 01:34:20,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2022-10-16 01:34:20,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2022-10-16 01:34:20,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2022-10-16 01:34:20,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2022-10-16 01:34:20,077 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2022-10-16 01:34:20,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2022-10-16 01:34:20,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2022-10-16 01:34:20,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2022-10-16 01:34:20,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2022-10-16 01:34:20,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2022-10-16 01:34:20,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2022-10-16 01:34:20,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2022-10-16 01:34:20,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 01:34:20,096 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:34:20,102 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 01:34:20,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:34:20 BoogieIcfgContainer [2022-10-16 01:34:20,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 01:34:20,184 INFO L158 Benchmark]: Toolchain (without parser) took 4661.56ms. Allocated memory was 152.0MB in the beginning and 195.0MB in the end (delta: 43.0MB). Free memory was 125.4MB in the beginning and 108.2MB in the end (delta: 17.2MB). Peak memory consumption was 60.8MB. Max. memory is 8.0GB. [2022-10-16 01:34:20,185 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 152.0MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 01:34:20,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.47ms. Allocated memory is still 152.0MB. Free memory was 125.2MB in the beginning and 115.0MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-16 01:34:20,185 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.18ms. Allocated memory is still 152.0MB. Free memory was 114.8MB in the beginning and 113.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 01:34:20,186 INFO L158 Benchmark]: Boogie Preprocessor took 29.81ms. Allocated memory is still 152.0MB. Free memory was 113.3MB in the beginning and 112.0MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-16 01:34:20,187 INFO L158 Benchmark]: RCFGBuilder took 528.05ms. Allocated memory is still 152.0MB. Free memory was 112.0MB in the beginning and 100.2MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-10-16 01:34:20,188 INFO L158 Benchmark]: TraceAbstraction took 3795.47ms. Allocated memory was 152.0MB in the beginning and 195.0MB in the end (delta: 43.0MB). Free memory was 99.6MB in the beginning and 108.2MB in the end (delta: -8.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-10-16 01:34:20,190 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 152.0MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 250.47ms. Allocated memory is still 152.0MB. Free memory was 125.2MB in the beginning and 115.0MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.18ms. Allocated memory is still 152.0MB. Free memory was 114.8MB in the beginning and 113.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.81ms. Allocated memory is still 152.0MB. Free memory was 113.3MB in the beginning and 112.0MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 528.05ms. Allocated memory is still 152.0MB. Free memory was 112.0MB in the beginning and 100.2MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3795.47ms. Allocated memory was 152.0MB in the beginning and 195.0MB in the end (delta: 43.0MB). Free memory was 99.6MB in the beginning and 108.2MB in the end (delta: -8.6MB). Peak memory consumption was 34.6MB. 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 - UnprovableResult [Line: 33]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 33. Possible FailurePath: [L5] int a = 1, b; [L7-L9] struct dummy { int *a, *b; } global = {&a, &b}; VAL [a={4:0}, b={5:0}, global={6:0}] [L23] struct dummy *pd = &global; [L25] CALL assign2(&pd->a, &pd->b) [L18] EXPR \read(**pb) VAL [\read(**pb)={5:0}, a={4:0}, b={5:0}, global={6:0}, pa={6:0}, pa={6:0}, pb={6:4}, pb={6:4}] [L18] EXPR \read(**pb) VAL [\read(**pb)={5:0}, \read(**pb)={5:0}, a={4:0}, b={5:0}, global={6:0}, pa={6:0}, pa={6:0}, pb={6:4}, pb={6:4}] [L18] CALL assign(*pb, *pb) [L13] EXPR \read(*pb) VAL [\read(*pb)=0, a={4:0}, b={5:0}, global={6:0}, pa={5:0}, pa={5:0}, pb={5:0}, pb={5:0}] [L13] *pa = *pb VAL [\read(*pb)=0, a={4:0}, b={5:0}, global={6:0}, pa={5:0}, pa={5:0}, pb={5:0}, pb={5:0}] [L18] RET assign(*pb, *pb) [L25] RET assign2(&pd->a, &pd->b) [L27] EXPR \read(a) VAL [\read(a)=1, a={4:0}, b={5:0}, global={6:0}, pd={6:0}] [L27] EXPR \read(b) VAL [\read(a)=1, \read(b)=0, a={4:0}, b={5:0}, global={6:0}, pd={6:0}] [L27] COND TRUE a != b [L33] reach_error() VAL [a={4:0}, b={5:0}, global={6:0}, pd={6:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 302 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 302 mSDsluCounter, 213 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 225 IncrementalHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 106 mSDtfsCounter, 225 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 58, 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, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 710 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-16 01:34:20,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...