/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:04:18,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:04:18,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:04:18,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:04:18,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:04:18,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:04:18,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:04:18,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:04:18,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:04:18,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:04:18,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:04:18,253 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:04:18,253 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:04:18,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:04:18,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:04:18,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:04:18,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:04:18,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:04:18,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:04:18,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:04:18,259 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:04:18,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:04:18,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:04:18,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:04:18,269 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:04:18,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:04:18,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:04:18,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:04:18,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:04:18,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:04:18,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:04:18,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:04:18,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:04:18,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:04:18,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:04:18,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:04:18,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:04:18,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:04:18,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:04:18,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:04:18,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:04:18,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:04:18,284 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:04:18,290 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:04:18,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:04:18,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:04:18,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:04:18,291 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:04:18,291 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:04:18,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:04:18,291 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:04:18,291 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:04:18,292 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:04:18,292 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:04:18,292 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:04:18,292 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:04:18,292 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:04:18,292 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:04:18,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:04:18,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:04:18,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:04:18,292 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:04:18,292 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:04:18,293 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:04:18,293 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:04:18,293 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 09:04:18,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:04:18,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:04:18,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:04:18,505 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:04:18,505 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:04:18,506 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i [2022-04-28 09:04:18,547 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75a0e94b/830e6e56f74348b48cf06fbcf1903231/FLAGc0be0f9a2 [2022-04-28 09:04:18,961 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:04:18,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i [2022-04-28 09:04:18,967 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75a0e94b/830e6e56f74348b48cf06fbcf1903231/FLAGc0be0f9a2 [2022-04-28 09:04:18,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75a0e94b/830e6e56f74348b48cf06fbcf1903231 [2022-04-28 09:04:18,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:04:18,983 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:04:18,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:04:18,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:04:18,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:04:18,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:04:18" (1/1) ... [2022-04-28 09:04:18,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f0471b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:18, skipping insertion in model container [2022-04-28 09:04:18,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:04:18" (1/1) ... [2022-04-28 09:04:18,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:04:19,002 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:04:19,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i[825,838] [2022-04-28 09:04:19,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:04:19,181 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:04:19,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i[825,838] [2022-04-28 09:04:19,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:04:19,219 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:04:19,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:19 WrapperNode [2022-04-28 09:04:19,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:04:19,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:04:19,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:04:19,221 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:04:19,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:19" (1/1) ... [2022-04-28 09:04:19,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:19" (1/1) ... [2022-04-28 09:04:19,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:19" (1/1) ... [2022-04-28 09:04:19,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:19" (1/1) ... [2022-04-28 09:04:19,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:19" (1/1) ... [2022-04-28 09:04:19,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:19" (1/1) ... [2022-04-28 09:04:19,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:19" (1/1) ... [2022-04-28 09:04:19,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:04:19,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:04:19,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:04:19,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:04:19,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:19" (1/1) ... [2022-04-28 09:04:19,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:04:19,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:04:19,286 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-04-28 09:04:19,291 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-04-28 09:04:19,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:04:19,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:04:19,328 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:04:19,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:04:19,328 INFO L138 BoogieDeclarations]: Found implementation of procedure glob2 [2022-04-28 09:04:19,328 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:04:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:04:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:04:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:04:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:04:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:04:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:04:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:04:19,329 INFO L130 BoogieDeclarations]: Found specification of procedure glob2 [2022-04-28 09:04:19,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:04:19,330 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:04:19,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 09:04:19,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:04:19,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:04:19,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:04:19,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:04:19,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:04:19,396 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:04:19,397 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:04:19,511 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:04:19,518 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:04:19,518 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:04:19,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:04:19 BoogieIcfgContainer [2022-04-28 09:04:19,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:04:19,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:04:19,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:04:19,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:04:19,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:04:18" (1/3) ... [2022-04-28 09:04:19,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c99a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:04:19, skipping insertion in model container [2022-04-28 09:04:19,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:19" (2/3) ... [2022-04-28 09:04:19,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8c99a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:04:19, skipping insertion in model container [2022-04-28 09:04:19,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:04:19" (3/3) ... [2022-04-28 09:04:19,524 INFO L111 eAbstractionObserver]: Analyzing ICFG veris.c_NetBSD-libc_loop.i [2022-04-28 09:04:19,533 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:04:19,533 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:04:19,570 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:04:19,576 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@472a830f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@34a0556e [2022-04-28 09:04:19,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:04:19,582 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:04:19,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 09:04:19,586 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:19,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:04:19,587 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:19,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:19,590 INFO L85 PathProgramCache]: Analyzing trace with hash 49640583, now seen corresponding path program 1 times [2022-04-28 09:04:19,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:19,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1846696164] [2022-04-28 09:04:19,602 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:04:19,602 INFO L85 PathProgramCache]: Analyzing trace with hash 49640583, now seen corresponding path program 2 times [2022-04-28 09:04:19,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:19,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211777771] [2022-04-28 09:04:19,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:19,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:19,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:19,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {29#true} is VALID [2022-04-28 09:04:19,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 09:04:19,906 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #50#return; {29#true} is VALID [2022-04-28 09:04:19,908 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {39#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:19,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {29#true} is VALID [2022-04-28 09:04:19,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 09:04:19,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #50#return; {29#true} is VALID [2022-04-28 09:04:19,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret3 := main(); {29#true} is VALID [2022-04-28 09:04:19,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {34#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-28 09:04:19,912 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {35#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-28 09:04:19,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-28 09:04:19,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-28 09:04:19,915 INFO L272 TraceCheckUtils]: 9: Hoare triple {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {37#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:04:19,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {38#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:04:19,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {30#false} is VALID [2022-04-28 09:04:19,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-28 09:04:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:04:19,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:19,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211777771] [2022-04-28 09:04:19,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211777771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:19,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:19,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:04:19,920 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:19,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1846696164] [2022-04-28 09:04:19,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1846696164] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:19,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:19,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:04:19,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145830226] [2022-04-28 09:04:19,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:19,924 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 09:04:19,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:19,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:19,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:19,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:04:19,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:19,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:04:19,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:04:19,972 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:20,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:20,420 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-28 09:04:20,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:04:20,421 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 09:04:20,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:20,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-28 09:04:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-28 09:04:20,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-28 09:04:20,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:20,487 INFO L225 Difference]: With dead ends: 55 [2022-04-28 09:04:20,487 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 09:04:20,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-28 09:04:20,491 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:04:20,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 57 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:04:20,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 09:04:20,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-04-28 09:04:20,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:20,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:20,524 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:20,524 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:20,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:20,526 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 09:04:20,526 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 09:04:20,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:20,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:20,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-28 09:04:20,527 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-28 09:04:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:20,529 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 09:04:20,529 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 09:04:20,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:20,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:20,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:20,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:20,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-28 09:04:20,531 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 13 [2022-04-28 09:04:20,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:20,532 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-28 09:04:20,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:20,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-28 09:04:20,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:20,573 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 09:04:20,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 09:04:20,574 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:20,574 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:04:20,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:04:20,575 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:20,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:20,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1781648093, now seen corresponding path program 1 times [2022-04-28 09:04:20,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:20,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [608545562] [2022-04-28 09:04:20,701 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:04:20,701 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:04:20,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1781648093, now seen corresponding path program 2 times [2022-04-28 09:04:20,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:20,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646532204] [2022-04-28 09:04:20,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:20,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:20,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:20,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {262#true} is VALID [2022-04-28 09:04:20,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 09:04:20,844 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #50#return; {262#true} is VALID [2022-04-28 09:04:20,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-28 09:04:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:20,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#true} ~cond := #in~cond; {262#true} is VALID [2022-04-28 09:04:20,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume !(0 == ~cond); {262#true} is VALID [2022-04-28 09:04:20,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 09:04:20,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-28 09:04:20,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {277#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:20,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {262#true} is VALID [2022-04-28 09:04:20,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 09:04:20,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #50#return; {262#true} is VALID [2022-04-28 09:04:20,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret3 := main(); {262#true} is VALID [2022-04-28 09:04:20,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {267#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-28 09:04:20,867 INFO L272 TraceCheckUtils]: 6: Hoare triple {267#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {268#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-28 09:04:20,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-28 09:04:20,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-28 09:04:20,868 INFO L272 TraceCheckUtils]: 9: Hoare triple {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {262#true} is VALID [2022-04-28 09:04:20,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {262#true} ~cond := #in~cond; {262#true} is VALID [2022-04-28 09:04:20,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#true} assume !(0 == ~cond); {262#true} is VALID [2022-04-28 09:04:20,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 09:04:20,869 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {262#true} {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-28 09:04:20,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-28 09:04:20,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {269#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-28 09:04:20,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-28 09:04:20,872 INFO L272 TraceCheckUtils]: 17: Hoare triple {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {275#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:04:20,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {276#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:04:20,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {276#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {263#false} is VALID [2022-04-28 09:04:20,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-28 09:04:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:04:20,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:20,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646532204] [2022-04-28 09:04:20,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646532204] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:04:20,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507652792] [2022-04-28 09:04:20,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:04:20,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:20,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:04:20,877 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:04:20,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 09:04:20,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 09:04:20,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:04:20,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 09:04:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:20,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:04:21,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {262#true} is VALID [2022-04-28 09:04:21,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {262#true} is VALID [2022-04-28 09:04:21,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 09:04:21,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #50#return; {262#true} is VALID [2022-04-28 09:04:21,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret3 := main(); {262#true} is VALID [2022-04-28 09:04:21,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {296#(and (<= main_~bound~0.offset ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base))} is VALID [2022-04-28 09:04:21,249 INFO L272 TraceCheckUtils]: 6: Hoare triple {296#(and (<= main_~bound~0.offset ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {300#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} is VALID [2022-04-28 09:04:21,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {300#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-28 09:04:21,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-28 09:04:21,250 INFO L272 TraceCheckUtils]: 9: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {262#true} is VALID [2022-04-28 09:04:21,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {262#true} ~cond := #in~cond; {262#true} is VALID [2022-04-28 09:04:21,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#true} assume !(0 == ~cond); {262#true} is VALID [2022-04-28 09:04:21,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 09:04:21,252 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {262#true} {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} #46#return; {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-28 09:04:21,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-28 09:04:21,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-28 09:04:21,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-28 09:04:21,254 INFO L272 TraceCheckUtils]: 17: Hoare triple {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {335#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:04:21,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {335#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:04:21,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {263#false} is VALID [2022-04-28 09:04:21,255 INFO L290 TraceCheckUtils]: 20: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-28 09:04:21,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 09:04:21,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:04:21,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-28 09:04:21,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {339#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {263#false} is VALID [2022-04-28 09:04:21,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {335#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {339#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:04:21,559 INFO L272 TraceCheckUtils]: 17: Hoare triple {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {335#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:04:21,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {274#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-28 09:04:21,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-28 09:04:21,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-28 09:04:21,562 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {262#true} {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} #46#return; {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-28 09:04:21,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 09:04:21,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#true} assume !(0 == ~cond); {262#true} is VALID [2022-04-28 09:04:21,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {262#true} ~cond := #in~cond; {262#true} is VALID [2022-04-28 09:04:21,562 INFO L272 TraceCheckUtils]: 9: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {262#true} is VALID [2022-04-28 09:04:21,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-28 09:04:21,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {300#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {304#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-28 09:04:21,564 INFO L272 TraceCheckUtils]: 6: Hoare triple {296#(and (<= main_~bound~0.offset ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {300#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} is VALID [2022-04-28 09:04:21,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {296#(and (<= main_~bound~0.offset ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base))} is VALID [2022-04-28 09:04:21,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret3 := main(); {262#true} is VALID [2022-04-28 09:04:21,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #50#return; {262#true} is VALID [2022-04-28 09:04:21,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-28 09:04:21,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {262#true} is VALID [2022-04-28 09:04:21,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {262#true} is VALID [2022-04-28 09:04:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 09:04:21,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507652792] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:04:21,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:04:21,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2022-04-28 09:04:21,567 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:21,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [608545562] [2022-04-28 09:04:21,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [608545562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:21,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:21,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:04:21,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589060726] [2022-04-28 09:04:21,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:21,568 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-28 09:04:21,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:21,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:21,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:21,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:04:21,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:21,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:04:21,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:04:21,584 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:21,921 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 09:04:21,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 09:04:21,922 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-28 09:04:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:21,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:21,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-28 09:04:21,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:21,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-28 09:04:21,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 33 transitions. [2022-04-28 09:04:21,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:21,953 INFO L225 Difference]: With dead ends: 36 [2022-04-28 09:04:21,953 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 09:04:21,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:04:21,954 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 32 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:04:21,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 39 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:04:21,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 09:04:21,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-28 09:04:21,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:21,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:04:21,968 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:04:21,969 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:04:21,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:21,970 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 09:04:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 09:04:21,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:21,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:21,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 09:04:21,971 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 09:04:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:21,972 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 09:04:21,972 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 09:04:21,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:21,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:21,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:21,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:21,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:04:21,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-28 09:04:21,974 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 21 [2022-04-28 09:04:21,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:21,974 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-28 09:04:21,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:21,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-28 09:04:22,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:22,001 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 09:04:22,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 09:04:22,001 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:22,001 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:04:22,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 09:04:22,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:22,220 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:22,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:22,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1581946061, now seen corresponding path program 3 times [2022-04-28 09:04:22,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:22,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [410013212] [2022-04-28 09:04:22,270 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:04:22,271 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:04:22,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1581946061, now seen corresponding path program 4 times [2022-04-28 09:04:22,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:22,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049659945] [2022-04-28 09:04:22,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:22,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:22,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:22,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {644#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {625#true} is VALID [2022-04-28 09:04:22,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-28 09:04:22,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {625#true} {625#true} #50#return; {625#true} is VALID [2022-04-28 09:04:22,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-28 09:04:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:22,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2022-04-28 09:04:22,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2022-04-28 09:04:22,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-28 09:04:22,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {625#true} {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-28 09:04:22,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 09:04:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:22,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2022-04-28 09:04:22,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2022-04-28 09:04:22,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-28 09:04:22,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {625#true} {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-28 09:04:22,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {625#true} call ULTIMATE.init(); {644#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:22,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {644#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {625#true} is VALID [2022-04-28 09:04:22,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-28 09:04:22,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {625#true} {625#true} #50#return; {625#true} is VALID [2022-04-28 09:04:22,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {625#true} call #t~ret3 := main(); {625#true} is VALID [2022-04-28 09:04:22,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {625#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {630#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= main_~bound~0.offset ~tmp~0.offset))} is VALID [2022-04-28 09:04:22,393 INFO L272 TraceCheckUtils]: 6: Hoare triple {630#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= main_~bound~0.offset ~tmp~0.offset))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {631#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} is VALID [2022-04-28 09:04:22,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {631#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-28 09:04:22,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-28 09:04:22,394 INFO L272 TraceCheckUtils]: 9: Hoare triple {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {625#true} is VALID [2022-04-28 09:04:22,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2022-04-28 09:04:22,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2022-04-28 09:04:22,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-28 09:04:22,395 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {625#true} {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-28 09:04:22,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-28 09:04:22,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-28 09:04:22,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-28 09:04:22,396 INFO L272 TraceCheckUtils]: 17: Hoare triple {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {625#true} is VALID [2022-04-28 09:04:22,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2022-04-28 09:04:22,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2022-04-28 09:04:22,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-28 09:04:22,397 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {625#true} {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #46#return; {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-28 09:04:22,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-28 09:04:22,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-28 09:04:22,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {632#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {641#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-28 09:04:22,398 INFO L272 TraceCheckUtils]: 25: Hoare triple {641#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {642#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:04:22,410 INFO L290 TraceCheckUtils]: 26: Hoare triple {642#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {643#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:04:22,410 INFO L290 TraceCheckUtils]: 27: Hoare triple {643#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {626#false} is VALID [2022-04-28 09:04:22,410 INFO L290 TraceCheckUtils]: 28: Hoare triple {626#false} assume !false; {626#false} is VALID [2022-04-28 09:04:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 09:04:22,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:22,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049659945] [2022-04-28 09:04:22,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049659945] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:04:22,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94155747] [2022-04-28 09:04:22,411 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:04:22,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:22,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:04:22,412 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:04:22,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 09:04:22,461 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:04:22,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:04:22,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 09:04:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:22,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:04:22,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {625#true} call ULTIMATE.init(); {625#true} is VALID [2022-04-28 09:04:22,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {625#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);~tmp~0.base, ~tmp~0.offset := 0, 0; {625#true} is VALID [2022-04-28 09:04:22,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-28 09:04:22,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {625#true} {625#true} #50#return; {625#true} is VALID [2022-04-28 09:04:22,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {625#true} call #t~ret3 := main(); {625#true} is VALID [2022-04-28 09:04:22,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {625#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {663#(<= main_~bound~0.offset (+ 4 |main_~#pathbuf~0.offset|))} is VALID [2022-04-28 09:04:22,648 INFO L272 TraceCheckUtils]: 6: Hoare triple {663#(<= main_~bound~0.offset (+ 4 |main_~#pathbuf~0.offset|))} call #t~ret2 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {667#(<= |glob2_#in~pathlim.offset| (+ |glob2_#in~pathbuf.offset| 4))} is VALID [2022-04-28 09:04:22,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {667#(<= |glob2_#in~pathlim.offset| (+ |glob2_#in~pathbuf.offset| 4))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {671#(<= glob2_~pathlim.offset (+ 4 glob2_~p~0.offset))} is VALID [2022-04-28 09:04:22,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {671#(<= glob2_~pathlim.offset (+ 4 glob2_~p~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {671#(<= glob2_~pathlim.offset (+ 4 glob2_~p~0.offset))} is VALID [2022-04-28 09:04:22,649 INFO L272 TraceCheckUtils]: 9: Hoare triple {671#(<= glob2_~pathlim.offset (+ 4 glob2_~p~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {625#true} is VALID [2022-04-28 09:04:22,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2022-04-28 09:04:22,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2022-04-28 09:04:22,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-28 09:04:22,650 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {625#true} {671#(<= glob2_~pathlim.offset (+ 4 glob2_~p~0.offset))} #46#return; {671#(<= glob2_~pathlim.offset (+ 4 glob2_~p~0.offset))} is VALID [2022-04-28 09:04:22,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {671#(<= glob2_~pathlim.offset (+ 4 glob2_~p~0.offset))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {671#(<= glob2_~pathlim.offset (+ 4 glob2_~p~0.offset))} is VALID [2022-04-28 09:04:22,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {671#(<= glob2_~pathlim.offset (+ 4 glob2_~p~0.offset))} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {696#(<= glob2_~pathlim.offset glob2_~p~0.offset)} is VALID [2022-04-28 09:04:22,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {696#(<= glob2_~pathlim.offset glob2_~p~0.offset)} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {696#(<= glob2_~pathlim.offset glob2_~p~0.offset)} is VALID [2022-04-28 09:04:22,651 INFO L272 TraceCheckUtils]: 17: Hoare triple {696#(<= glob2_~pathlim.offset glob2_~p~0.offset)} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {625#true} is VALID [2022-04-28 09:04:22,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {625#true} ~cond := #in~cond; {625#true} is VALID [2022-04-28 09:04:22,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {625#true} assume !(0 == ~cond); {625#true} is VALID [2022-04-28 09:04:22,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {625#true} assume true; {625#true} is VALID [2022-04-28 09:04:22,652 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {625#true} {696#(<= glob2_~pathlim.offset glob2_~p~0.offset)} #46#return; {696#(<= glob2_~pathlim.offset glob2_~p~0.offset)} is VALID [2022-04-28 09:04:22,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {696#(<= glob2_~pathlim.offset glob2_~p~0.offset)} call write~int(1, ~p~0.base, ~p~0.offset, 4); {696#(<= glob2_~pathlim.offset glob2_~p~0.offset)} is VALID [2022-04-28 09:04:22,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {696#(<= glob2_~pathlim.offset glob2_~p~0.offset)} #t~post1.base, #t~post1.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post1.base, 4 + #t~post1.offset;havoc #t~post1.base, #t~post1.offset; {721#(<= (+ 4 glob2_~pathlim.offset) glob2_~p~0.offset)} is VALID [2022-04-28 09:04:22,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {721#(<= (+ 4 glob2_~pathlim.offset) glob2_~p~0.offset)} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {626#false} is VALID [2022-04-28 09:04:22,653 INFO L272 TraceCheckUtils]: 25: Hoare triple {626#false} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {626#false} is VALID [2022-04-28 09:04:22,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {626#false} ~cond := #in~cond; {626#false} is VALID [2022-04-28 09:04:22,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {626#false} assume 0 == ~cond; {626#false} is VALID [2022-04-28 09:04:22,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {626#false} assume !false; {626#false} is VALID [2022-04-28 09:04:22,654 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 09:04:22,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:04:22,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94155747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:22,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:04:22,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2022-04-28 09:04:22,654 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:22,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [410013212] [2022-04-28 09:04:22,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [410013212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:22,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:22,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:04:22,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760970731] [2022-04-28 09:04:22,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:22,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-28 09:04:22,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:22,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:22,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:22,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:04:22,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:22,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:04:22,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:04:22,673 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:22,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:22,822 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 09:04:22,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:04:22,822 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-28 09:04:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:22,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-28 09:04:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-28 09:04:22,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-28 09:04:22,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:22,847 INFO L225 Difference]: With dead ends: 35 [2022-04-28 09:04:22,847 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:04:22,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2022-04-28 09:04:22,848 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:04:22,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:04:22,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:04:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:04:22,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:22,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:04:22,849 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:04:22,850 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:04:22,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:22,850 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:04:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:04:22,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:22,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:22,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:04:22,850 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 09:04:22,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:22,850 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:04:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:04:22,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:22,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:22,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:22,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:22,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 09:04:22,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:04:22,850 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-04-28 09:04:22,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:22,851 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:04:22,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:22,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:04:22,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:04:22,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:22,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:04:22,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 09:04:23,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 09:04:23,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:04:23,284 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 09:04:23,284 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 09:04:23,284 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 09:04:23,284 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (let ((.cse1 (= ~tmp~0.base glob2_~p~0.base)) (.cse2 (+ |glob2_#in~pathbuf.offset| 4))) (or (let ((.cse0 (+ 4 glob2_~p~0.offset))) (and (<= .cse0 ~tmp~0.offset) .cse1 (<= glob2_~pathlim.offset .cse0))) (and (<= glob2_~pathlim.offset glob2_~p~0.offset) .cse1 (<= glob2_~p~0.offset ~tmp~0.offset)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (not (<= .cse2 ~tmp~0.offset)) (not (<= |glob2_#in~pathlim.offset| .cse2)))) [2022-04-28 09:04:23,284 INFO L902 garLoopResultBuilder]: At program point glob2ENTRY(lines 25 36) the Hoare annotation is: true [2022-04-28 09:04:23,285 INFO L895 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (let ((.cse1 (+ |glob2_#in~pathbuf.offset| 4))) (or (let ((.cse0 (+ 4 glob2_~p~0.offset))) (and (<= .cse0 ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~pathlim.offset .cse0))) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (<= glob2_~pathlim.offset glob2_~p~0.offset) (not (<= .cse1 ~tmp~0.offset)) (not (<= |glob2_#in~pathlim.offset| .cse1)))) [2022-04-28 09:04:23,285 INFO L895 garLoopResultBuilder]: At program point L29-2(lines 29 33) the Hoare annotation is: (let ((.cse1 (+ |glob2_#in~pathbuf.offset| 4))) (or (let ((.cse0 (+ 4 glob2_~p~0.offset))) (and (<= .cse0 ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~pathlim.offset .cse0))) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (<= glob2_~pathlim.offset glob2_~p~0.offset) (not (<= .cse1 ~tmp~0.offset)) (not (<= |glob2_#in~pathlim.offset| .cse1)))) [2022-04-28 09:04:23,285 INFO L895 garLoopResultBuilder]: At program point L29-3(lines 29 33) the Hoare annotation is: (let ((.cse1 (= ~tmp~0.base glob2_~p~0.base)) (.cse2 (+ |glob2_#in~pathbuf.offset| 4))) (or (let ((.cse0 (+ 4 glob2_~p~0.offset))) (and (<= .cse0 ~tmp~0.offset) .cse1 (<= glob2_~pathlim.offset .cse0))) (and (<= glob2_~pathlim.offset glob2_~p~0.offset) .cse1 (<= glob2_~p~0.offset ~tmp~0.offset)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (not (<= .cse2 ~tmp~0.offset)) (not (<= |glob2_#in~pathlim.offset| .cse2)) (<= (+ 4 glob2_~pathlim.offset) glob2_~p~0.offset))) [2022-04-28 09:04:23,285 INFO L902 garLoopResultBuilder]: At program point L29-4(lines 29 33) the Hoare annotation is: true [2022-04-28 09:04:23,285 INFO L902 garLoopResultBuilder]: At program point glob2EXIT(lines 25 36) the Hoare annotation is: true [2022-04-28 09:04:23,285 INFO L902 garLoopResultBuilder]: At program point glob2FINAL(lines 25 36) the Hoare annotation is: true [2022-04-28 09:04:23,285 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (+ 4 |main_~#pathbuf~0.offset|))) (and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= main_~bound~0.offset .cse0) (<= .cse0 ~tmp~0.offset))) [2022-04-28 09:04:23,285 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 38 49) the Hoare annotation is: (and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base)) [2022-04-28 09:04:23,285 INFO L895 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset)) [2022-04-28 09:04:23,285 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 38 49) the Hoare annotation is: true [2022-04-28 09:04:23,285 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 38 49) the Hoare annotation is: true [2022-04-28 09:04:23,285 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:04:23,285 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 09:04:23,286 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:04:23,286 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:04:23,286 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:04:23,286 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:04:23,286 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:04:23,286 INFO L895 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:04:23,286 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:04:23,286 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 19) the Hoare annotation is: true [2022-04-28 09:04:23,286 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 19) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:04:23,286 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 19) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:04:23,286 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:04:23,288 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2] [2022-04-28 09:04:23,289 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:04:23,291 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:04:23,291 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:04:23,294 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 09:04:23,303 INFO L163 areAnnotationChecker]: CFG has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:04:23,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:04:23 BoogieIcfgContainer [2022-04-28 09:04:23,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:04:23,316 INFO L158 Benchmark]: Toolchain (without parser) took 4332.93ms. Allocated memory was 184.5MB in the beginning and 276.8MB in the end (delta: 92.3MB). Free memory was 131.2MB in the beginning and 181.1MB in the end (delta: -49.9MB). Peak memory consumption was 42.6MB. Max. memory is 8.0GB. [2022-04-28 09:04:23,316 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:04:23,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.42ms. Allocated memory is still 184.5MB. Free memory was 131.0MB in the beginning and 160.6MB in the end (delta: -29.5MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2022-04-28 09:04:23,318 INFO L158 Benchmark]: Boogie Preprocessor took 40.92ms. Allocated memory is still 184.5MB. Free memory was 160.6MB in the beginning and 159.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 09:04:23,318 INFO L158 Benchmark]: RCFGBuilder took 257.02ms. Allocated memory is still 184.5MB. Free memory was 159.1MB in the beginning and 147.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 09:04:23,318 INFO L158 Benchmark]: TraceAbstraction took 3794.33ms. Allocated memory was 184.5MB in the beginning and 276.8MB in the end (delta: 92.3MB). Free memory was 147.0MB in the beginning and 181.1MB in the end (delta: -34.1MB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. [2022-04-28 09:04:23,321 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.42ms. Allocated memory is still 184.5MB. Free memory was 131.0MB in the beginning and 160.6MB in the end (delta: -29.5MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.92ms. Allocated memory is still 184.5MB. Free memory was 160.6MB in the beginning and 159.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 257.02ms. Allocated memory is still 184.5MB. Free memory was 159.1MB in the beginning and 147.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3794.33ms. Allocated memory was 184.5MB in the beginning and 276.8MB in the end (delta: 92.3MB). Free memory was 147.0MB in the beginning and 181.1MB in the end (delta: -34.1MB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 77 mSDsluCounter, 147 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 224 IncrementalHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 41 mSDtfsCounter, 224 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 26, 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, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 44 PreInvPairs, 68 NumberOfFragments, 241 HoareAnnotationTreeSize, 44 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 26 FomulaSimplificationsInter, 487 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((4 + p <= tmp && tmp == p) && pathlim <= 4 + p) || ((pathlim <= p && tmp == p) && p <= tmp)) || !(tmp == pathbuf)) || !(pathbuf + 4 <= tmp)) || !(pathlim <= pathbuf + 4)) || 4 + pathlim <= p - ProcedureContractResult [Line: 25]: Procedure Contract for glob2 Derived contract for procedure glob2: 1 - ProcedureContractResult [Line: 38]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-28 09:04:23,359 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...