/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/termination-memory-linkedlists/cll_by_lseg-alloca-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:58:59,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:58:59,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:58:59,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:58:59,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:58:59,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:58:59,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:58:59,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:58:59,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:58:59,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:58:59,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:58:59,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:58:59,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:58:59,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:58:59,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:58:59,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:58:59,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:58:59,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:58:59,681 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:58:59,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:58:59,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:58:59,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:58:59,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:58:59,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:58:59,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:58:59,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:58:59,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:58:59,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:58:59,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:58:59,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:58:59,713 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:58:59,714 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:58:59,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:58:59,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:58:59,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:58:59,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:58:59,719 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:58:59,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:58:59,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:58:59,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:58:59,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:58:59,722 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 17:58:59,772 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:58:59,772 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:58:59,773 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:58:59,773 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:58:59,775 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:58:59,775 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:58:59,777 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:58:59,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:58:59,778 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:58:59,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:58:59,779 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:58:59,779 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:58:59,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:58:59,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:58:59,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:58:59,780 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:58:59,780 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:58:59,780 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:58:59,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:58:59,781 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:58:59,781 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:58:59,781 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:58:59,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:58:59,781 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:58:59,782 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:58:59,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:58:59,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:58:59,782 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:58:59,782 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:58:59,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:58:59,783 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 17:59:00,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:59:00,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:59:00,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:59:00,231 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:59:00,232 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:59:00,233 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-linkedlists/cll_by_lseg-alloca-2.i [2022-10-15 17:59:00,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e94515a48/9e5562b973a845b99dab2ad36ac29546/FLAG5b173f8ea [2022-10-15 17:59:00,946 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:59:00,946 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-linkedlists/cll_by_lseg-alloca-2.i [2022-10-15 17:59:00,971 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e94515a48/9e5562b973a845b99dab2ad36ac29546/FLAG5b173f8ea [2022-10-15 17:59:01,250 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e94515a48/9e5562b973a845b99dab2ad36ac29546 [2022-10-15 17:59:01,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:59:01,261 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:59:01,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:59:01,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:59:01,270 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:59:01,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:59:01" (1/1) ... [2022-10-15 17:59:01,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d51def9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:01, skipping insertion in model container [2022-10-15 17:59:01,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:59:01" (1/1) ... [2022-10-15 17:59:01,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:59:01,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:59:01,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:59:01,688 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:59:01,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:59:01,769 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:59:01,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:01 WrapperNode [2022-10-15 17:59:01,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:59:01,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:59:01,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:59:01,772 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:59:01,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:01" (1/1) ... [2022-10-15 17:59:01,821 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:01" (1/1) ... [2022-10-15 17:59:01,848 INFO L138 Inliner]: procedures = 115, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 26 [2022-10-15 17:59:01,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:59:01,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:59:01,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:59:01,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:59:01,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:01" (1/1) ... [2022-10-15 17:59:01,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:01" (1/1) ... [2022-10-15 17:59:01,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:01" (1/1) ... [2022-10-15 17:59:01,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:01" (1/1) ... [2022-10-15 17:59:01,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:01" (1/1) ... [2022-10-15 17:59:01,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:01" (1/1) ... [2022-10-15 17:59:01,880 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:01" (1/1) ... [2022-10-15 17:59:01,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:01" (1/1) ... [2022-10-15 17:59:01,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:59:01,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:59:01,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:59:01,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:59:01,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:01" (1/1) ... [2022-10-15 17:59:01,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:59:01,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:59:01,925 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 17:59:01,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 17:59:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 17:59:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 17:59:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 17:59:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure new_lseg [2022-10-15 17:59:01,996 INFO L138 BoogieDeclarations]: Found implementation of procedure new_lseg [2022-10-15 17:59:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:59:01,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:59:02,132 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:59:02,134 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:59:02,349 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:59:02,356 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:59:02,356 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 17:59:02,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:59:02 BoogieIcfgContainer [2022-10-15 17:59:02,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:59:02,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:59:02,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:59:02,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:59:02,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:59:01" (1/3) ... [2022-10-15 17:59:02,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c2a3465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:59:02, skipping insertion in model container [2022-10-15 17:59:02,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:59:01" (2/3) ... [2022-10-15 17:59:02,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c2a3465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:59:02, skipping insertion in model container [2022-10-15 17:59:02,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:59:02" (3/3) ... [2022-10-15 17:59:02,369 INFO L112 eAbstractionObserver]: Analyzing ICFG cll_by_lseg-alloca-2.i [2022-10-15 17:59:02,390 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:59:02,391 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-10-15 17:59:02,451 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:59:02,464 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;@2f740436, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:59:02,465 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-10-15 17:59:02,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:59:02,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:59:02,479 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:02,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:59:02,481 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-10-15 17:59:02,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:02,495 INFO L85 PathProgramCache]: Analyzing trace with hash 925617, now seen corresponding path program 1 times [2022-10-15 17:59:02,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:02,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801831830] [2022-10-15 17:59:02,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:02,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:02,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:02,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:02,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801831830] [2022-10-15 17:59:02,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801831830] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:02,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:02,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:59:02,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18493741] [2022-10-15 17:59:02,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:02,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:59:02,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:02,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:59:02,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:02,798 INFO L87 Difference]: Start difference. First operand has 28 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:02,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:02,889 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-10-15 17:59:02,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:59:02,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 17:59:02,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:02,905 INFO L225 Difference]: With dead ends: 29 [2022-10-15 17:59:02,906 INFO L226 Difference]: Without dead ends: 26 [2022-10-15 17:59:02,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:02,916 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:02,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 42 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:59:02,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-10-15 17:59:02,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-10-15 17:59:02,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:59:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-10-15 17:59:02,961 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 4 [2022-10-15 17:59:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:02,961 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-10-15 17:59:02,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:02,962 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-10-15 17:59:02,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:59:02,962 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:02,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:59:02,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:59:02,964 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-10-15 17:59:02,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:02,965 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-10-15 17:59:02,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:02,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196452136] [2022-10-15 17:59:02,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:02,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:03,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:03,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196452136] [2022-10-15 17:59:03,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196452136] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:03,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:03,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:59:03,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026450932] [2022-10-15 17:59:03,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:03,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:59:03,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:03,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:59:03,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:03,065 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:03,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:03,099 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-10-15 17:59:03,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:59:03,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 17:59:03,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:03,101 INFO L225 Difference]: With dead ends: 25 [2022-10-15 17:59:03,101 INFO L226 Difference]: Without dead ends: 25 [2022-10-15 17:59:03,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:03,103 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:03,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 30 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:59:03,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-10-15 17:59:03,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-10-15 17:59:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 21 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:59:03,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-10-15 17:59:03,110 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 4 [2022-10-15 17:59:03,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:03,111 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-10-15 17:59:03,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:03,111 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-10-15 17:59:03,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:59:03,112 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:03,112 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:59:03,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:59:03,113 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-10-15 17:59:03,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:03,113 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2022-10-15 17:59:03,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:03,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65490303] [2022-10-15 17:59:03,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:03,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:03,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:03,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:03,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65490303] [2022-10-15 17:59:03,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65490303] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:03,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:03,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:59:03,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891356541] [2022-10-15 17:59:03,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:03,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:59:03,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:03,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:59:03,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:03,307 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:03,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:03,334 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-10-15 17:59:03,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:59:03,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 17:59:03,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:03,336 INFO L225 Difference]: With dead ends: 24 [2022-10-15 17:59:03,336 INFO L226 Difference]: Without dead ends: 24 [2022-10-15 17:59:03,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:03,338 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:03,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 36 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:59:03,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-10-15 17:59:03,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-10-15 17:59:03,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.5) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:59:03,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-10-15 17:59:03,345 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 4 [2022-10-15 17:59:03,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:03,345 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-10-15 17:59:03,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:03,345 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-10-15 17:59:03,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-15 17:59:03,346 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:03,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:03,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:59:03,347 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting new_lsegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-10-15 17:59:03,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:03,348 INFO L85 PathProgramCache]: Analyzing trace with hash 176439576, now seen corresponding path program 1 times [2022-10-15 17:59:03,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:03,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827839035] [2022-10-15 17:59:03,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:03,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:03,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:03,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827839035] [2022-10-15 17:59:03,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827839035] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:03,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:03,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:59:03,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381357321] [2022-10-15 17:59:03,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:03,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:59:03,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:03,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:59:03,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:03,472 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:03,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:03,526 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-10-15 17:59:03,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:59:03,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-15 17:59:03,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:03,530 INFO L225 Difference]: With dead ends: 25 [2022-10-15 17:59:03,530 INFO L226 Difference]: Without dead ends: 25 [2022-10-15 17:59:03,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:03,537 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 32 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-15 17:59:03,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:59:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-10-15 17:59:03,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-10-15 17:59:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 19 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:59:03,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-10-15 17:59:03,551 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 8 [2022-10-15 17:59:03,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:03,552 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-10-15 17:59:03,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:03,553 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-10-15 17:59:03,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-15 17:59:03,555 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:03,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:03,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:59:03,556 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting new_lsegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-10-15 17:59:03,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:03,557 INFO L85 PathProgramCache]: Analyzing trace with hash 176439577, now seen corresponding path program 1 times [2022-10-15 17:59:03,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:03,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534334357] [2022-10-15 17:59:03,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:03,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:03,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:03,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:03,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534334357] [2022-10-15 17:59:03,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534334357] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:03,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:03,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:59:03,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445085297] [2022-10-15 17:59:03,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:03,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:59:03,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:03,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:59:03,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:03,699 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:03,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:03,723 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-10-15 17:59:03,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:59:03,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-15 17:59:03,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:03,724 INFO L225 Difference]: With dead ends: 22 [2022-10-15 17:59:03,725 INFO L226 Difference]: Without dead ends: 22 [2022-10-15 17:59:03,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:59:03,727 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:03,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:59:03,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-10-15 17:59:03,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-10-15 17:59:03,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 18 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:59:03,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-10-15 17:59:03,732 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 8 [2022-10-15 17:59:03,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:03,733 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-10-15 17:59:03,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:59:03,733 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-10-15 17:59:03,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 17:59:03,734 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:03,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:03,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 17:59:03,735 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-10-15 17:59:03,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:03,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2054686088, now seen corresponding path program 1 times [2022-10-15 17:59:03,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:03,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540836444] [2022-10-15 17:59:03,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:03,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:03,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-10-15 17:59:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:03,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:03,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540836444] [2022-10-15 17:59:03,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540836444] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:03,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:03,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:59:03,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685063660] [2022-10-15 17:59:03,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:03,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:59:03,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:03,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:59:03,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:59:03,896 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 17:59:03,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:03,962 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-10-15 17:59:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:59:03,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-10-15 17:59:03,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:03,964 INFO L225 Difference]: With dead ends: 26 [2022-10-15 17:59:03,965 INFO L226 Difference]: Without dead ends: 26 [2022-10-15 17:59:03,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:59:03,966 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:03,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 29 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:59:03,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-10-15 17:59:03,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-10-15 17:59:03,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.375) internal successors, (22), 20 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 17:59:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-10-15 17:59:03,974 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 10 [2022-10-15 17:59:03,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:03,975 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-10-15 17:59:03,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 17:59:03,976 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-10-15 17:59:03,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 17:59:03,976 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:03,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:03,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 17:59:03,977 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-10-15 17:59:03,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:03,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2054686089, now seen corresponding path program 1 times [2022-10-15 17:59:03,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:03,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883814973] [2022-10-15 17:59:03,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:03,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:04,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-10-15 17:59:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:59:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:59:04,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:59:04,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883814973] [2022-10-15 17:59:04,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883814973] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:59:04,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:59:04,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:59:04,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857805220] [2022-10-15 17:59:04,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:59:04,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:59:04,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:59:04,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:59:04,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:59:04,229 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 17:59:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:59:04,291 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-10-15 17:59:04,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:59:04,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-10-15 17:59:04,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:59:04,295 INFO L225 Difference]: With dead ends: 29 [2022-10-15 17:59:04,295 INFO L226 Difference]: Without dead ends: 29 [2022-10-15 17:59:04,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:59:04,298 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:59:04,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 36 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:59:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-10-15 17:59:04,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-10-15 17:59:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 17:59:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-10-15 17:59:04,308 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 10 [2022-10-15 17:59:04,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:59:04,309 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-10-15 17:59:04,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 17:59:04,309 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-10-15 17:59:04,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 17:59:04,310 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:59:04,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:04,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 17:59:04,311 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-10-15 17:59:04,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:59:04,312 INFO L85 PathProgramCache]: Analyzing trace with hash -720669814, now seen corresponding path program 1 times [2022-10-15 17:59:04,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:59:04,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680226454] [2022-10-15 17:59:04,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:59:04,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:59:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:59:04,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 17:59:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:59:04,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 17:59:04,391 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 17:59:04,392 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (8 of 9 remaining) [2022-10-15 17:59:04,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2022-10-15 17:59:04,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2022-10-15 17:59:04,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2022-10-15 17:59:04,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2022-10-15 17:59:04,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location new_lsegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2022-10-15 17:59:04,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location new_lsegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2022-10-15 17:59:04,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location new_lsegErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2022-10-15 17:59:04,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location new_lsegErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 9 remaining) [2022-10-15 17:59:04,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 17:59:04,402 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:59:04,407 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:59:04,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:59:04 BoogieIcfgContainer [2022-10-15 17:59:04,434 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:59:04,435 INFO L158 Benchmark]: Toolchain (without parser) took 3179.28ms. Allocated memory was 162.5MB in the beginning and 209.7MB in the end (delta: 47.2MB). Free memory was 135.7MB in the beginning and 176.0MB in the end (delta: -40.4MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. [2022-10-15 17:59:04,436 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 162.5MB. Free memory is still 133.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:59:04,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.39ms. Allocated memory is still 162.5MB. Free memory was 135.4MB in the beginning and 120.1MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-10-15 17:59:04,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.90ms. Allocated memory is still 162.5MB. Free memory was 120.1MB in the beginning and 118.3MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:59:04,437 INFO L158 Benchmark]: Boogie Preprocessor took 35.74ms. Allocated memory is still 162.5MB. Free memory was 118.3MB in the beginning and 117.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:59:04,437 INFO L158 Benchmark]: RCFGBuilder took 469.90ms. Allocated memory is still 162.5MB. Free memory was 117.1MB in the beginning and 141.0MB in the end (delta: -23.9MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. [2022-10-15 17:59:04,438 INFO L158 Benchmark]: TraceAbstraction took 2072.80ms. Allocated memory was 162.5MB in the beginning and 209.7MB in the end (delta: 47.2MB). Free memory was 140.5MB in the beginning and 176.0MB in the end (delta: -35.5MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2022-10-15 17:59:04,440 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 162.5MB. Free memory is still 133.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 505.39ms. Allocated memory is still 162.5MB. Free memory was 135.4MB in the beginning and 120.1MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 77.90ms. Allocated memory is still 162.5MB. Free memory was 120.1MB in the beginning and 118.3MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.74ms. Allocated memory is still 162.5MB. Free memory was 118.3MB in the beginning and 117.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 469.90ms. Allocated memory is still 162.5MB. Free memory was 117.1MB in the beginning and 141.0MB in the end (delta: -23.9MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. * TraceAbstraction took 2072.80ms. Allocated memory was 162.5MB in the beginning and 209.7MB in the end (delta: 47.2MB). Free memory was 140.5MB in the beginning and 176.0MB in the end (delta: -35.5MB). Peak memory consumption was 11.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: 569]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 569. Possible FailurePath: [L571] int n = __VERIFIER_nondet_int(); [L572] COND FALSE !(n < 1) [L575] CALL, EXPR new_cll(n) [L557] node_t* x = malloc(sizeof(node_t)); [L558] x->val = n VAL [\old(n)=1, n=1, x={-1:0}] [L559] CALL, EXPR new_lseg(x,n-1) VAL [\old(n)=0, p={-1:0}] [L548] COND TRUE n==0 [L549] return p; VAL [\old(n)=0, \result={-1:0}, n=0, p={-1:0}, p={-1:0}] [L559] RET, EXPR new_lseg(x,n-1) VAL [\old(n)=1, n=1, new_lseg(x,n-1)={-1:0}, x={-1:0}] [L559] x->next = new_lseg(x,n-1) VAL [\old(n)=1, n=1, new_lseg(x,n-1)={-1:0}, x={-1:0}] [L560] return x; VAL [\old(n)=1, \result={-1:0}, n=1, x={-1:0}] [L575] RET, EXPR new_cll(n) [L575] node_t* x = new_cll(n); [L576] return 0; VAL [\result=0, n=1, x={-1: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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 238 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 144 IncrementalHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 154 mSDtfsCounter, 144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 23, 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, 7 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 143 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-15 17:59:04,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...