/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/loop-invgen/NetBSD_loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:27:46,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:27:46,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:27:46,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:27:46,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:27:46,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:27:46,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:27:46,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:27:46,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:27:46,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:27:46,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:27:46,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:27:46,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:27:46,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:27:46,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:27:46,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:27:46,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:27:46,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:27:46,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:27:46,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:27:46,358 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:27:46,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:27:46,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:27:46,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:27:46,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:27:46,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:27:46,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:27:46,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:27:46,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:27:46,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:27:46,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:27:46,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:27:46,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:27:46,368 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:27:46,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:27:46,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:27:46,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:27:46,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:27:46,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:27:46,370 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:27:46,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:27:46,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:27:46,375 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:27:46,383 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:27:46,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:27:46,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:27:46,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:27:46,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:27:46,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:27:46,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:27:46,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:27:46,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:27:46,385 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:27:46,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:27:46,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:27:46,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:27:46,386 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:27:46,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:27:46,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:27:46,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:27:46,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:27:46,386 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:27:46,386 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:27:46,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:27:46,386 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:27:46,386 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:27:46,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:27:46,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:27:46,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:27:46,570 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:27:46,571 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:27:46,572 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/NetBSD_loop.i [2022-04-28 09:27:46,627 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40301ac6b/a07b6155f84c48bc9cff31044a8fd280/FLAGbe6021c65 [2022-04-28 09:27:46,975 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:27:46,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/NetBSD_loop.i [2022-04-28 09:27:46,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40301ac6b/a07b6155f84c48bc9cff31044a8fd280/FLAGbe6021c65 [2022-04-28 09:27:46,988 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40301ac6b/a07b6155f84c48bc9cff31044a8fd280 [2022-04-28 09:27:46,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:27:46,990 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:27:46,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:27:46,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:27:46,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:27:46,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:27:46" (1/1) ... [2022-04-28 09:27:46,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12931281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:46, skipping insertion in model container [2022-04-28 09:27:46,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:27:46" (1/1) ... [2022-04-28 09:27:47,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:27:47,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:27:47,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/NetBSD_loop.i[893,906] [2022-04-28 09:27:47,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:27:47,137 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:27:47,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/NetBSD_loop.i[893,906] [2022-04-28 09:27:47,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:27:47,155 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:27:47,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:47 WrapperNode [2022-04-28 09:27:47,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:27:47,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:27:47,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:27:47,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:27:47,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:47" (1/1) ... [2022-04-28 09:27:47,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:47" (1/1) ... [2022-04-28 09:27:47,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:47" (1/1) ... [2022-04-28 09:27:47,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:47" (1/1) ... [2022-04-28 09:27:47,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:47" (1/1) ... [2022-04-28 09:27:47,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:47" (1/1) ... [2022-04-28 09:27:47,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:47" (1/1) ... [2022-04-28 09:27:47,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:27:47,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:27:47,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:27:47,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:27:47,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:47" (1/1) ... [2022-04-28 09:27:47,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:27:47,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:27:47,192 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:27:47,194 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:27:47,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:27:47,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:27:47,218 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:27:47,218 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:27:47,219 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:27:47,219 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:27:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:27:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:27:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:27:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:27:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:27:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:27:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:27:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:27:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:27:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:27:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:27:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:27:47,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:27:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:27:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:27:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:27:47,259 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:27:47,261 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:27:47,391 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:27:47,395 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:27:47,395 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:27:47,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:27:47 BoogieIcfgContainer [2022-04-28 09:27:47,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:27:47,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:27:47,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:27:47,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:27:47,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:27:46" (1/3) ... [2022-04-28 09:27:47,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20658ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:27:47, skipping insertion in model container [2022-04-28 09:27:47,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:27:47" (2/3) ... [2022-04-28 09:27:47,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20658ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:27:47, skipping insertion in model container [2022-04-28 09:27:47,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:27:47" (3/3) ... [2022-04-28 09:27:47,404 INFO L111 eAbstractionObserver]: Analyzing ICFG NetBSD_loop.i [2022-04-28 09:27:47,413 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:27:47,413 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:27:47,439 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:27:47,449 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@2e850e28, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@434316ad [2022-04-28 09:27:47,449 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:27:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 09:27:47,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 09:27:47,469 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:27:47,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:27:47,470 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:27:47,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:27:47,473 INFO L85 PathProgramCache]: Analyzing trace with hash -390730657, now seen corresponding path program 1 times [2022-04-28 09:27:47,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:27:47,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2110152805] [2022-04-28 09:27:47,495 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:27:47,496 INFO L85 PathProgramCache]: Analyzing trace with hash -390730657, now seen corresponding path program 2 times [2022-04-28 09:27:47,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:27:47,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218636232] [2022-04-28 09:27:47,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:27:47,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:27:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:47,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:27:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:47,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= |#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(9, 2); {26#true} is VALID [2022-04-28 09:27:47,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 09:27:47,725 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #61#return; {26#true} is VALID [2022-04-28 09:27:47,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:27:47,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= |#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(9, 2); {26#true} is VALID [2022-04-28 09:27:47,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 09:27:47,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #61#return; {26#true} is VALID [2022-04-28 09:27:47,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret3 := main(); {26#true} is VALID [2022-04-28 09:27:47,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {26#true} is VALID [2022-04-28 09:27:47,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {26#true} is VALID [2022-04-28 09:27:47,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {31#(<= 0 main_~glob2_p_off~0)} is VALID [2022-04-28 09:27:47,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#(<= 0 main_~glob2_p_off~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {31#(<= 0 main_~glob2_p_off~0)} is VALID [2022-04-28 09:27:47,731 INFO L272 TraceCheckUtils]: 9: Hoare triple {31#(<= 0 main_~glob2_p_off~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {32#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:27:47,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {33#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:27:47,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {27#false} is VALID [2022-04-28 09:27:47,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-28 09:27:47,734 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:27:47,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:27:47,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218636232] [2022-04-28 09:27:47,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218636232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:27:47,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:27:47,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:27:47,737 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:27:47,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2110152805] [2022-04-28 09:27:47,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2110152805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:27:47,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:27:47,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:27:47,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362780522] [2022-04-28 09:27:47,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:27:47,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 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:27:47,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:27:47,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:27:47,764 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:27:47,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:27:47,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:27:47,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:27:47,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:27:47,785 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:27:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:48,035 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-04-28 09:27:48,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:27:48,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 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:27:48,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:27:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:27:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-28 09:27:48,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:27:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-28 09:27:48,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-28 09:27:48,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:27:48,104 INFO L225 Difference]: With dead ends: 45 [2022-04-28 09:27:48,104 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 09:27:48,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:27:48,109 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:27:48,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 42 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:27:48,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 09:27:48,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 09:27:48,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:27:48,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:27:48,138 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:27:48,139 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:27:48,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:48,146 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 09:27:48,146 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 09:27:48,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:27:48,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:27:48,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-28 09:27:48,149 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 22 states. [2022-04-28 09:27:48,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:48,150 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 09:27:48,150 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 09:27:48,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:27:48,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:27:48,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:27:48,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:27:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:27:48,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-28 09:27:48,153 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 13 [2022-04-28 09:27:48,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:27:48,153 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-28 09:27:48,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:27:48,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-28 09:27:48,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:27:48,177 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 09:27:48,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 09:27:48,178 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:27:48,178 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:27:48,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:27:48,179 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:27:48,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:27:48,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1367367025, now seen corresponding path program 1 times [2022-04-28 09:27:48,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:27:48,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [884054134] [2022-04-28 09:27:48,184 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:27:48,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1367367025, now seen corresponding path program 2 times [2022-04-28 09:27:48,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:27:48,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329591350] [2022-04-28 09:27:48,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:27:48,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:27:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:48,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:27:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:48,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#(and (= |#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(9, 2); {223#true} is VALID [2022-04-28 09:27:48,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {223#true} assume true; {223#true} is VALID [2022-04-28 09:27:48,270 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {223#true} {223#true} #61#return; {223#true} is VALID [2022-04-28 09:27:48,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-28 09:27:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:48,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {223#true} ~cond := #in~cond; {223#true} is VALID [2022-04-28 09:27:48,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {223#true} assume !(0 == ~cond); {223#true} is VALID [2022-04-28 09:27:48,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {223#true} assume true; {223#true} is VALID [2022-04-28 09:27:48,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {223#true} {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #57#return; {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:48,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {223#true} call ULTIMATE.init(); {236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:27:48,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#(and (= |#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(9, 2); {223#true} is VALID [2022-04-28 09:27:48,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {223#true} assume true; {223#true} is VALID [2022-04-28 09:27:48,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {223#true} {223#true} #61#return; {223#true} is VALID [2022-04-28 09:27:48,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {223#true} call #t~ret3 := main(); {223#true} is VALID [2022-04-28 09:27:48,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {223#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {223#true} is VALID [2022-04-28 09:27:48,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {223#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {228#(<= 1 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:48,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {228#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:48,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:48,281 INFO L272 TraceCheckUtils]: 9: Hoare triple {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {223#true} is VALID [2022-04-28 09:27:48,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {223#true} ~cond := #in~cond; {223#true} is VALID [2022-04-28 09:27:48,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {223#true} assume !(0 == ~cond); {223#true} is VALID [2022-04-28 09:27:48,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {223#true} assume true; {223#true} is VALID [2022-04-28 09:27:48,282 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {223#true} {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #57#return; {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:48,282 INFO L272 TraceCheckUtils]: 14: Hoare triple {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {234#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:27:48,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {234#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {235#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:27:48,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {235#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {224#false} is VALID [2022-04-28 09:27:48,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {224#false} assume !false; {224#false} is VALID [2022-04-28 09:27:48,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:27:48,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:27:48,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329591350] [2022-04-28 09:27:48,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329591350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:27:48,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:27:48,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:27:48,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:27:48,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [884054134] [2022-04-28 09:27:48,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [884054134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:27:48,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:27:48,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:27:48,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900937534] [2022-04-28 09:27:48,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:27:48,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 09:27:48,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:27:48,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:27:48,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:27:48,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:27:48,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:27:48,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:27:48,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:27:48,301 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:27:48,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:48,566 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-28 09:27:48,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:27:48,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 09:27:48,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:27:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:27:48,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-28 09:27:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:27:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-28 09:27:48,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2022-04-28 09:27:48,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:27:48,596 INFO L225 Difference]: With dead ends: 32 [2022-04-28 09:27:48,596 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 09:27:48,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:27:48,600 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:27:48,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 37 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:27:48,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 09:27:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-28 09:27:48,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:27:48,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:27:48,620 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:27:48,620 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:27:48,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:48,623 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 09:27:48,623 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 09:27:48,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:27:48,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:27:48,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-28 09:27:48,625 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-28 09:27:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:48,628 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 09:27:48,628 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 09:27:48,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:27:48,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:27:48,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:27:48,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:27:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 09:27:48,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-28 09:27:48,636 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 18 [2022-04-28 09:27:48,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:27:48,636 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-28 09:27:48,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:27:48,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-28 09:27:48,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:27:48,669 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-28 09:27:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 09:27:48,670 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:27:48,670 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:27:48,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:27:48,671 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:27:48,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:27:48,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1382920975, now seen corresponding path program 1 times [2022-04-28 09:27:48,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:27:48,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1102754680] [2022-04-28 09:27:48,794 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:27:48,794 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:27:48,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1382920975, now seen corresponding path program 2 times [2022-04-28 09:27:48,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:27:48,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342587323] [2022-04-28 09:27:48,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:27:48,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:27:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:48,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:27:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:48,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {453#(and (= |#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(9, 2); {431#true} is VALID [2022-04-28 09:27:48,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-28 09:27:48,862 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {431#true} {431#true} #61#return; {431#true} is VALID [2022-04-28 09:27:48,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-28 09:27:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:48,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {431#true} ~cond := #in~cond; {431#true} is VALID [2022-04-28 09:27:48,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {431#true} assume !(0 == ~cond); {431#true} is VALID [2022-04-28 09:27:48,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-28 09:27:48,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {431#true} {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #57#return; {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:48,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-28 09:27:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:48,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {431#true} ~cond := #in~cond; {431#true} is VALID [2022-04-28 09:27:48,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {431#true} assume !(0 == ~cond); {431#true} is VALID [2022-04-28 09:27:48,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-28 09:27:48,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {431#true} {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #59#return; {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:48,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-28 09:27:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:48,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {431#true} ~cond := #in~cond; {431#true} is VALID [2022-04-28 09:27:48,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {431#true} assume !(0 == ~cond); {431#true} is VALID [2022-04-28 09:27:48,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-28 09:27:48,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {431#true} {446#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #57#return; {446#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:48,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {431#true} call ULTIMATE.init(); {453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:27:48,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#(and (= |#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(9, 2); {431#true} is VALID [2022-04-28 09:27:48,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-28 09:27:48,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {431#true} {431#true} #61#return; {431#true} is VALID [2022-04-28 09:27:48,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {431#true} call #t~ret3 := main(); {431#true} is VALID [2022-04-28 09:27:48,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {431#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {431#true} is VALID [2022-04-28 09:27:48,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {431#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {436#(<= 1 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:48,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {436#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:48,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:48,892 INFO L272 TraceCheckUtils]: 9: Hoare triple {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {431#true} is VALID [2022-04-28 09:27:48,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {431#true} ~cond := #in~cond; {431#true} is VALID [2022-04-28 09:27:48,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {431#true} assume !(0 == ~cond); {431#true} is VALID [2022-04-28 09:27:48,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-28 09:27:48,893 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {431#true} {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #57#return; {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:48,893 INFO L272 TraceCheckUtils]: 14: Hoare triple {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {431#true} is VALID [2022-04-28 09:27:48,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {431#true} ~cond := #in~cond; {431#true} is VALID [2022-04-28 09:27:48,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {431#true} assume !(0 == ~cond); {431#true} is VALID [2022-04-28 09:27:48,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-28 09:27:48,894 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {431#true} {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #59#return; {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:48,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {446#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:48,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {446#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {446#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:48,895 INFO L272 TraceCheckUtils]: 21: Hoare triple {446#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {431#true} is VALID [2022-04-28 09:27:48,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {431#true} ~cond := #in~cond; {431#true} is VALID [2022-04-28 09:27:48,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {431#true} assume !(0 == ~cond); {431#true} is VALID [2022-04-28 09:27:48,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-28 09:27:48,896 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {431#true} {446#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #57#return; {446#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:48,896 INFO L272 TraceCheckUtils]: 26: Hoare triple {446#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {451#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:27:48,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {451#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {452#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:27:48,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {452#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {432#false} is VALID [2022-04-28 09:27:48,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {432#false} assume !false; {432#false} is VALID [2022-04-28 09:27:48,898 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 09:27:48,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:27:48,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342587323] [2022-04-28 09:27:48,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342587323] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:27:48,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074662550] [2022-04-28 09:27:48,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:27:48,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:27:48,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:27:48,900 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:27:48,916 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:27:48,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:27:48,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:27:48,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 09:27:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:48,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:27:49,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {431#true} call ULTIMATE.init(); {431#true} is VALID [2022-04-28 09:27:49,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {431#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(9, 2); {431#true} is VALID [2022-04-28 09:27:49,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-28 09:27:49,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {431#true} {431#true} #61#return; {431#true} is VALID [2022-04-28 09:27:49,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {431#true} call #t~ret3 := main(); {431#true} is VALID [2022-04-28 09:27:49,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {431#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {431#true} is VALID [2022-04-28 09:27:49,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {431#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {436#(<= 1 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:49,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {436#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {478#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2022-04-28 09:27:49,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {478#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {478#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2022-04-28 09:27:49,288 INFO L272 TraceCheckUtils]: 9: Hoare triple {478#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {431#true} is VALID [2022-04-28 09:27:49,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {431#true} ~cond := #in~cond; {431#true} is VALID [2022-04-28 09:27:49,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {431#true} assume !(0 == ~cond); {431#true} is VALID [2022-04-28 09:27:49,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-28 09:27:49,289 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {431#true} {478#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} #57#return; {478#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2022-04-28 09:27:49,289 INFO L272 TraceCheckUtils]: 14: Hoare triple {478#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {431#true} is VALID [2022-04-28 09:27:49,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {431#true} ~cond := #in~cond; {431#true} is VALID [2022-04-28 09:27:49,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {431#true} assume !(0 == ~cond); {431#true} is VALID [2022-04-28 09:27:49,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-28 09:27:49,292 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {431#true} {478#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} #59#return; {478#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} is VALID [2022-04-28 09:27:49,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {478#(and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 0))} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {515#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} is VALID [2022-04-28 09:27:49,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {515#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {515#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} is VALID [2022-04-28 09:27:49,293 INFO L272 TraceCheckUtils]: 21: Hoare triple {515#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {431#true} is VALID [2022-04-28 09:27:49,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {431#true} ~cond := #in~cond; {431#true} is VALID [2022-04-28 09:27:49,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {431#true} assume !(0 == ~cond); {431#true} is VALID [2022-04-28 09:27:49,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-28 09:27:49,294 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {431#true} {515#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} #57#return; {515#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} is VALID [2022-04-28 09:27:49,295 INFO L272 TraceCheckUtils]: 26: Hoare triple {515#(and (<= main_~glob2_p_off~0 1) (<= 1 main_~MAXPATHLEN~0))} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {537#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:27:49,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {537#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {541#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:27:49,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {541#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {432#false} is VALID [2022-04-28 09:27:49,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {432#false} assume !false; {432#false} is VALID [2022-04-28 09:27:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 09:27:49,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:27:49,441 INFO L290 TraceCheckUtils]: 29: Hoare triple {432#false} assume !false; {432#false} is VALID [2022-04-28 09:27:49,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {541#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {432#false} is VALID [2022-04-28 09:27:49,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {537#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {541#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:27:49,450 INFO L272 TraceCheckUtils]: 26: Hoare triple {446#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {537#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:27:49,451 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {431#true} {446#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #57#return; {446#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:49,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-28 09:27:49,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {431#true} assume !(0 == ~cond); {431#true} is VALID [2022-04-28 09:27:49,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {431#true} ~cond := #in~cond; {431#true} is VALID [2022-04-28 09:27:49,453 INFO L272 TraceCheckUtils]: 21: Hoare triple {446#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {431#true} is VALID [2022-04-28 09:27:49,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {446#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {446#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:49,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {446#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:49,454 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {431#true} {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #59#return; {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:49,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-28 09:27:49,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {431#true} assume !(0 == ~cond); {431#true} is VALID [2022-04-28 09:27:49,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {431#true} ~cond := #in~cond; {431#true} is VALID [2022-04-28 09:27:49,455 INFO L272 TraceCheckUtils]: 14: Hoare triple {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {431#true} is VALID [2022-04-28 09:27:49,455 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {431#true} {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #57#return; {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:49,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-28 09:27:49,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {431#true} assume !(0 == ~cond); {431#true} is VALID [2022-04-28 09:27:49,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {431#true} ~cond := #in~cond; {431#true} is VALID [2022-04-28 09:27:49,456 INFO L272 TraceCheckUtils]: 9: Hoare triple {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {431#true} is VALID [2022-04-28 09:27:49,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:49,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {436#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {437#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:49,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {431#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {436#(<= 1 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:49,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {431#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {431#true} is VALID [2022-04-28 09:27:49,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {431#true} call #t~ret3 := main(); {431#true} is VALID [2022-04-28 09:27:49,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {431#true} {431#true} #61#return; {431#true} is VALID [2022-04-28 09:27:49,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {431#true} assume true; {431#true} is VALID [2022-04-28 09:27:49,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {431#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(9, 2); {431#true} is VALID [2022-04-28 09:27:49,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {431#true} call ULTIMATE.init(); {431#true} is VALID [2022-04-28 09:27:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 09:27:49,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074662550] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:27:49,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:27:49,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-04-28 09:27:49,460 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:27:49,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1102754680] [2022-04-28 09:27:49,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1102754680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:27:49,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:27:49,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:27:49,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332698323] [2022-04-28 09:27:49,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:27:49,462 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-28 09:27:49,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:27:49,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 09:27:49,476 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:27:49,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:27:49,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:27:49,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:27:49,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:27:49,477 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 09:27:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:49,720 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-04-28 09:27:49,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:27:49,720 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-28 09:27:49,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:27:49,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 09:27:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-28 09:27:49,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 09:27:49,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-28 09:27:49,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2022-04-28 09:27:49,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:27:49,757 INFO L225 Difference]: With dead ends: 40 [2022-04-28 09:27:49,757 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 09:27:49,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-04-28 09:27:49,760 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:27:49,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 42 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:27:49,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 09:27:49,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-28 09:27:49,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:27:49,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:27:49,787 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:27:49,788 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:27:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:49,791 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-28 09:27:49,791 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-28 09:27:49,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:27:49,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:27:49,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states. [2022-04-28 09:27:49,793 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states. [2022-04-28 09:27:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:49,796 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-28 09:27:49,796 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-28 09:27:49,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:27:49,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:27:49,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:27:49,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:27:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 09:27:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-28 09:27:49,802 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 30 [2022-04-28 09:27:49,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:27:49,802 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-28 09:27:49,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 09:27:49,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2022-04-28 09:27:49,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:27:49,830 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 09:27:49,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 09:27:49,832 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:27:49,832 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:27:49,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 09:27:50,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:27:50,048 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:27:50,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:27:50,048 INFO L85 PathProgramCache]: Analyzing trace with hash -213449841, now seen corresponding path program 3 times [2022-04-28 09:27:50,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:27:50,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [220848234] [2022-04-28 09:27:50,125 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:27:50,125 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:27:50,125 INFO L85 PathProgramCache]: Analyzing trace with hash -213449841, now seen corresponding path program 4 times [2022-04-28 09:27:50,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:27:50,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976130021] [2022-04-28 09:27:50,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:27:50,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:27:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:50,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:27:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:50,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {909#(and (= |#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(9, 2); {880#true} is VALID [2022-04-28 09:27:50,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {880#true} {880#true} #61#return; {880#true} is VALID [2022-04-28 09:27:50,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-28 09:27:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:50,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {880#true} ~cond := #in~cond; {880#true} is VALID [2022-04-28 09:27:50,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#true} assume !(0 == ~cond); {880#true} is VALID [2022-04-28 09:27:50,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #57#return; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-28 09:27:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:50,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {880#true} ~cond := #in~cond; {880#true} is VALID [2022-04-28 09:27:50,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#true} assume !(0 == ~cond); {880#true} is VALID [2022-04-28 09:27:50,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #59#return; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-28 09:27:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:50,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {880#true} ~cond := #in~cond; {880#true} is VALID [2022-04-28 09:27:50,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#true} assume !(0 == ~cond); {880#true} is VALID [2022-04-28 09:27:50,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #57#return; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-28 09:27:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:50,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {880#true} ~cond := #in~cond; {880#true} is VALID [2022-04-28 09:27:50,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#true} assume !(0 == ~cond); {880#true} is VALID [2022-04-28 09:27:50,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #59#return; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-28 09:27:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:50,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {880#true} ~cond := #in~cond; {880#true} is VALID [2022-04-28 09:27:50,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#true} assume !(0 == ~cond); {880#true} is VALID [2022-04-28 09:27:50,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {902#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #57#return; {902#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {909#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:27:50,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {909#(and (= |#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(9, 2); {880#true} is VALID [2022-04-28 09:27:50,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {880#true} #61#return; {880#true} is VALID [2022-04-28 09:27:50,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {880#true} call #t~ret3 := main(); {880#true} is VALID [2022-04-28 09:27:50,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {880#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {880#true} is VALID [2022-04-28 09:27:50,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {880#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {880#true} is VALID [2022-04-28 09:27:50,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {880#true} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,217 INFO L272 TraceCheckUtils]: 9: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {880#true} is VALID [2022-04-28 09:27:50,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {880#true} ~cond := #in~cond; {880#true} is VALID [2022-04-28 09:27:50,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {880#true} assume !(0 == ~cond); {880#true} is VALID [2022-04-28 09:27:50,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,218 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {880#true} {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #57#return; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,218 INFO L272 TraceCheckUtils]: 14: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {880#true} is VALID [2022-04-28 09:27:50,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {880#true} ~cond := #in~cond; {880#true} is VALID [2022-04-28 09:27:50,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {880#true} assume !(0 == ~cond); {880#true} is VALID [2022-04-28 09:27:50,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,218 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {880#true} {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #59#return; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,219 INFO L272 TraceCheckUtils]: 21: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {880#true} is VALID [2022-04-28 09:27:50,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {880#true} ~cond := #in~cond; {880#true} is VALID [2022-04-28 09:27:50,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {880#true} assume !(0 == ~cond); {880#true} is VALID [2022-04-28 09:27:50,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,220 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {880#true} {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #57#return; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,220 INFO L272 TraceCheckUtils]: 26: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {880#true} is VALID [2022-04-28 09:27:50,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {880#true} ~cond := #in~cond; {880#true} is VALID [2022-04-28 09:27:50,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {880#true} assume !(0 == ~cond); {880#true} is VALID [2022-04-28 09:27:50,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,221 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {880#true} {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #59#return; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {902#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,222 INFO L272 TraceCheckUtils]: 33: Hoare triple {902#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {880#true} is VALID [2022-04-28 09:27:50,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {880#true} ~cond := #in~cond; {880#true} is VALID [2022-04-28 09:27:50,222 INFO L290 TraceCheckUtils]: 35: Hoare triple {880#true} assume !(0 == ~cond); {880#true} is VALID [2022-04-28 09:27:50,222 INFO L290 TraceCheckUtils]: 36: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,222 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {880#true} {902#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #57#return; {902#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,223 INFO L272 TraceCheckUtils]: 38: Hoare triple {902#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {907#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:27:50,223 INFO L290 TraceCheckUtils]: 39: Hoare triple {907#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {908#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:27:50,224 INFO L290 TraceCheckUtils]: 40: Hoare triple {908#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {881#false} is VALID [2022-04-28 09:27:50,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {881#false} assume !false; {881#false} is VALID [2022-04-28 09:27:50,224 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 09:27:50,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:27:50,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976130021] [2022-04-28 09:27:50,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976130021] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:27:50,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573622295] [2022-04-28 09:27:50,225 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:27:50,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:27:50,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:27:50,226 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:27:50,227 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:27:50,265 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:27:50,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:27:50,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 09:27:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:27:50,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:27:50,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {880#true} is VALID [2022-04-28 09:27:50,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#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(9, 2); {880#true} is VALID [2022-04-28 09:27:50,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {880#true} #61#return; {880#true} is VALID [2022-04-28 09:27:50,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {880#true} call #t~ret3 := main(); {880#true} is VALID [2022-04-28 09:27:50,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {880#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {880#true} is VALID [2022-04-28 09:27:50,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {880#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {880#true} is VALID [2022-04-28 09:27:50,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {880#true} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,457 INFO L272 TraceCheckUtils]: 9: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {880#true} is VALID [2022-04-28 09:27:50,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {880#true} ~cond := #in~cond; {880#true} is VALID [2022-04-28 09:27:50,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {880#true} assume !(0 == ~cond); {880#true} is VALID [2022-04-28 09:27:50,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,457 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {880#true} {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #57#return; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,458 INFO L272 TraceCheckUtils]: 14: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {880#true} is VALID [2022-04-28 09:27:50,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {880#true} ~cond := #in~cond; {880#true} is VALID [2022-04-28 09:27:50,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {880#true} assume !(0 == ~cond); {880#true} is VALID [2022-04-28 09:27:50,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,458 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {880#true} {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #59#return; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,459 INFO L290 TraceCheckUtils]: 19: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,459 INFO L272 TraceCheckUtils]: 21: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {880#true} is VALID [2022-04-28 09:27:50,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {880#true} ~cond := #in~cond; {880#true} is VALID [2022-04-28 09:27:50,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {880#true} assume !(0 == ~cond); {880#true} is VALID [2022-04-28 09:27:50,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,460 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {880#true} {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #57#return; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,460 INFO L272 TraceCheckUtils]: 26: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {880#true} is VALID [2022-04-28 09:27:50,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {880#true} ~cond := #in~cond; {880#true} is VALID [2022-04-28 09:27:50,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {880#true} assume !(0 == ~cond); {880#true} is VALID [2022-04-28 09:27:50,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,461 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {880#true} {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #59#return; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {902#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,462 INFO L272 TraceCheckUtils]: 33: Hoare triple {902#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {880#true} is VALID [2022-04-28 09:27:50,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {880#true} ~cond := #in~cond; {880#true} is VALID [2022-04-28 09:27:50,462 INFO L290 TraceCheckUtils]: 35: Hoare triple {880#true} assume !(0 == ~cond); {880#true} is VALID [2022-04-28 09:27:50,462 INFO L290 TraceCheckUtils]: 36: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,466 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {880#true} {902#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #57#return; {902#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,467 INFO L272 TraceCheckUtils]: 38: Hoare triple {902#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {1027#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:27:50,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {1027#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1031#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:27:50,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {1031#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {881#false} is VALID [2022-04-28 09:27:50,468 INFO L290 TraceCheckUtils]: 41: Hoare triple {881#false} assume !false; {881#false} is VALID [2022-04-28 09:27:50,468 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 09:27:50,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:27:50,643 INFO L290 TraceCheckUtils]: 41: Hoare triple {881#false} assume !false; {881#false} is VALID [2022-04-28 09:27:50,643 INFO L290 TraceCheckUtils]: 40: Hoare triple {1031#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {881#false} is VALID [2022-04-28 09:27:50,646 INFO L290 TraceCheckUtils]: 39: Hoare triple {1027#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1031#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:27:50,646 INFO L272 TraceCheckUtils]: 38: Hoare triple {902#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {1027#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:27:50,647 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {880#true} {902#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} #57#return; {902#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {880#true} assume !(0 == ~cond); {880#true} is VALID [2022-04-28 09:27:50,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {880#true} ~cond := #in~cond; {880#true} is VALID [2022-04-28 09:27:50,647 INFO L272 TraceCheckUtils]: 33: Hoare triple {902#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {880#true} is VALID [2022-04-28 09:27:50,648 INFO L290 TraceCheckUtils]: 32: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {902#(<= main_~glob2_p_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,648 INFO L290 TraceCheckUtils]: 31: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,649 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {880#true} {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #59#return; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {880#true} assume !(0 == ~cond); {880#true} is VALID [2022-04-28 09:27:50,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {880#true} ~cond := #in~cond; {880#true} is VALID [2022-04-28 09:27:50,649 INFO L272 TraceCheckUtils]: 26: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {880#true} is VALID [2022-04-28 09:27:50,649 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {880#true} {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #57#return; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,650 INFO L290 TraceCheckUtils]: 23: Hoare triple {880#true} assume !(0 == ~cond); {880#true} is VALID [2022-04-28 09:27:50,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {880#true} ~cond := #in~cond; {880#true} is VALID [2022-04-28 09:27:50,650 INFO L272 TraceCheckUtils]: 21: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {880#true} is VALID [2022-04-28 09:27:50,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #t~post2 := ~glob2_p_off~0;~glob2_p_off~0 := 1 + #t~post2;havoc #t~post2; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,651 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {880#true} {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #59#return; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {880#true} assume !(0 == ~cond); {880#true} is VALID [2022-04-28 09:27:50,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {880#true} ~cond := #in~cond; {880#true} is VALID [2022-04-28 09:27:50,651 INFO L272 TraceCheckUtils]: 14: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {880#true} is VALID [2022-04-28 09:27:50,652 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {880#true} {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} #57#return; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {880#true} assume !(0 == ~cond); {880#true} is VALID [2022-04-28 09:27:50,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {880#true} ~cond := #in~cond; {880#true} is VALID [2022-04-28 09:27:50,652 INFO L272 TraceCheckUtils]: 9: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {880#true} is VALID [2022-04-28 09:27:50,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {880#true} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {885#(<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0)} is VALID [2022-04-28 09:27:50,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {880#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {880#true} is VALID [2022-04-28 09:27:50,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {880#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {880#true} is VALID [2022-04-28 09:27:50,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {880#true} call #t~ret3 := main(); {880#true} is VALID [2022-04-28 09:27:50,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {880#true} {880#true} #61#return; {880#true} is VALID [2022-04-28 09:27:50,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {880#true} assume true; {880#true} is VALID [2022-04-28 09:27:50,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#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(9, 2); {880#true} is VALID [2022-04-28 09:27:50,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {880#true} call ULTIMATE.init(); {880#true} is VALID [2022-04-28 09:27:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 09:27:50,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573622295] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:27:50,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:27:50,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-28 09:27:50,654 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:27:50,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [220848234] [2022-04-28 09:27:50,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [220848234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:27:50,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:27:50,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:27:50,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583699366] [2022-04-28 09:27:50,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:27:50,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2022-04-28 09:27:50,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:27:50,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 09:27:50,668 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:27:50,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:27:50,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:27:50,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:27:50,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-28 09:27:50,669 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 09:27:50,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:50,836 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-28 09:27:50,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:27:50,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2022-04-28 09:27:50,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:27:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 09:27:50,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-28 09:27:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 09:27:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-28 09:27:50,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-28 09:27:50,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:27:50,854 INFO L225 Difference]: With dead ends: 37 [2022-04-28 09:27:50,854 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:27:50,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:27:50,855 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:27:50,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 36 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:27:50,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:27:50,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:27:50,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:27:50,856 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:27:50,856 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:27:50,856 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:27:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:50,856 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:27:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:27:50,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:27:50,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:27:50,856 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:27:50,856 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:27:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:27:50,856 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:27:50,856 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:27:50,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:27:50,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:27:50,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:27:50,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:27:50,857 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:27:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:27:50,857 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2022-04-28 09:27:50,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:27:50,857 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:27:50,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 09:27:50,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:27:50,857 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:27:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:27:50,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:27:50,859 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:27:50,894 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:27:51,092 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,SelfDestructingSolverStorable3 [2022-04-28 09:27:51,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:27:51,256 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 09:27:51,256 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 09:27:51,256 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 09:27:51,256 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-28 09:27:51,256 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:27:51,256 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:27:51,256 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-28 09:27:51,256 INFO L902 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: true [2022-04-28 09:27:51,256 INFO L895 garLoopResultBuilder]: At program point L33-1(line 33) the Hoare annotation is: (<= 1 main_~MAXPATHLEN~0) [2022-04-28 09:27:51,256 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 45) the Hoare annotation is: true [2022-04-28 09:27:51,256 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 45) the Hoare annotation is: true [2022-04-28 09:27:51,257 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 45) the Hoare annotation is: true [2022-04-28 09:27:51,257 INFO L902 garLoopResultBuilder]: At program point L44(lines 25 45) the Hoare annotation is: true [2022-04-28 09:27:51,257 INFO L895 garLoopResultBuilder]: At program point L42(lines 38 43) the Hoare annotation is: (and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 main_~MAXPATHLEN~0) (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0)) [2022-04-28 09:27:51,257 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 main_~MAXPATHLEN~0) (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0)) [2022-04-28 09:27:51,257 INFO L895 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_p_off~0 main_~MAXPATHLEN~0) (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0)) [2022-04-28 09:27:51,257 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 43) the Hoare annotation is: (and (<= 1 main_~MAXPATHLEN~0) (<= main_~glob2_pathlim_off~0 main_~MAXPATHLEN~0) (<= 0 main_~glob2_p_off~0)) [2022-04-28 09:27:51,257 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:27:51,257 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 09:27:51,257 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:27:51,257 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:27:51,257 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:27:51,257 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:27:51,257 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:27:51,257 INFO L895 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:27:51,257 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-28 09:27:51,257 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:27:51,258 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:27:51,258 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:27:51,258 INFO L895 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:27:51,260 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2] [2022-04-28 09:27:51,261 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:27:51,263 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:27:51,263 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:27:51,263 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 09:27:51,264 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 09:27:51,264 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:27:51,264 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-28 09:27:51,265 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-28 09:27:51,272 INFO L163 areAnnotationChecker]: CFG has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:27:51,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:27:51 BoogieIcfgContainer [2022-04-28 09:27:51,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:27:51,279 INFO L158 Benchmark]: Toolchain (without parser) took 4288.51ms. Allocated memory was 197.1MB in the beginning and 254.8MB in the end (delta: 57.7MB). Free memory was 148.3MB in the beginning and 228.9MB in the end (delta: -80.5MB). Peak memory consumption was 110.6MB. Max. memory is 8.0GB. [2022-04-28 09:27:51,279 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 164.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:27:51,279 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.50ms. Allocated memory is still 197.1MB. Free memory was 148.1MB in the beginning and 174.5MB in the end (delta: -26.4MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-04-28 09:27:51,279 INFO L158 Benchmark]: Boogie Preprocessor took 17.21ms. Allocated memory is still 197.1MB. Free memory was 174.5MB in the beginning and 173.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 09:27:51,280 INFO L158 Benchmark]: RCFGBuilder took 223.14ms. Allocated memory is still 197.1MB. Free memory was 173.0MB in the beginning and 161.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 09:27:51,280 INFO L158 Benchmark]: TraceAbstraction took 3880.53ms. Allocated memory was 197.1MB in the beginning and 254.8MB in the end (delta: 57.7MB). Free memory was 160.9MB in the beginning and 228.9MB in the end (delta: -67.9MB). Peak memory consumption was 122.4MB. Max. memory is 8.0GB. [2022-04-28 09:27:51,281 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 197.1MB. Free memory is still 164.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 163.50ms. Allocated memory is still 197.1MB. Free memory was 148.1MB in the beginning and 174.5MB in the end (delta: -26.4MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.21ms. Allocated memory is still 197.1MB. Free memory was 174.5MB in the beginning and 173.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 223.14ms. Allocated memory is still 197.1MB. Free memory was 173.0MB in the beginning and 161.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3880.53ms. Allocated memory was 197.1MB in the beginning and 254.8MB in the end (delta: 57.7MB). Free memory was 160.9MB in the beginning and 228.9MB in the end (delta: -67.9MB). Peak memory consumption was 122.4MB. 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: 19]: 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 157 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 273 IncrementalHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 65 mSDtfsCounter, 273 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 163 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=3, InterpolantAutomatonStates: 32, 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, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 65 PreInvPairs, 94 NumberOfFragments, 101 HoareAnnotationTreeSize, 65 FomulaSimplifications, 9 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 155 FormulaSimplificationTreeSizeReductionInter, 0.1s 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: 38]: Loop Invariant Derived loop invariant: (1 <= MAXPATHLEN && glob2_pathlim_off <= MAXPATHLEN) && 0 <= glob2_p_off - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: 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:27:51,305 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...