/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:22:19,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:22:19,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:22:19,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:22:19,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:22:19,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:22:19,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:22:19,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:22:19,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:22:19,514 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:22:19,515 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:22:19,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:22:19,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:22:19,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:22:19,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:22:19,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:22:19,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:22:19,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:22:19,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:22:19,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:22:19,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:22:19,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:22:19,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:22:19,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:22:19,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:22:19,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:22:19,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:22:19,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:22:19,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:22:19,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:22:19,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:22:19,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:22:19,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:22:19,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:22:19,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:22:19,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:22:19,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:22:19,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:22:19,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:22:19,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:22:19,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:22:19,562 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:22:19,588 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:22:19,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:22:19,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:22:19,595 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:22:19,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:22:19,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:22:19,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:22:19,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:22:19,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:22:19,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:22:19,597 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:22:19,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:22:19,597 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:22:19,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:22:19,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:22:19,598 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:22:19,598 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:22:19,599 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:22:19,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:22:19,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:22:19,600 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:22:19,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:22:19,600 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:22:19,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:22:19,918 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:22:19,922 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:22:19,923 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:22:19,924 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:22:19,924 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i [2020-07-10 20:22:19,985 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b0589bb/6de63f0c3b4a4f4f9a181753acd830ac/FLAGe251a3899 [2020-07-10 20:22:20,444 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:22:20,445 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i [2020-07-10 20:22:20,452 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b0589bb/6de63f0c3b4a4f4f9a181753acd830ac/FLAGe251a3899 [2020-07-10 20:22:20,865 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b0589bb/6de63f0c3b4a4f4f9a181753acd830ac [2020-07-10 20:22:20,874 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:22:20,876 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:22:20,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:22:20,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:22:20,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:22:20,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:22:20" (1/1) ... [2020-07-10 20:22:20,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13a3d34a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:20, skipping insertion in model container [2020-07-10 20:22:20,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:22:20" (1/1) ... [2020-07-10 20:22:20,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:22:20,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:22:21,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:22:21,137 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:22:21,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:22:21,174 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:22:21,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:21 WrapperNode [2020-07-10 20:22:21,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:22:21,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:22:21,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:22:21,176 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:22:21,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:21" (1/1) ... [2020-07-10 20:22:21,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:21" (1/1) ... [2020-07-10 20:22:21,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:21" (1/1) ... [2020-07-10 20:22:21,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:21" (1/1) ... [2020-07-10 20:22:21,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:21" (1/1) ... [2020-07-10 20:22:21,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:21" (1/1) ... [2020-07-10 20:22:21,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:21" (1/1) ... [2020-07-10 20:22:21,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:22:21,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:22:21,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:22:21,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:22:21,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:22:21,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:22:21,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:22:21,391 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:22:21,391 INFO L138 BoogieDeclarations]: Found implementation of procedure glob2 [2020-07-10 20:22:21,391 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:22:21,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:22:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:22:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure glob2 [2020-07-10 20:22:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:22:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:22:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:22:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:22:21,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:22:21,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:22:21,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:22:21,727 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:22:21,727 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 20:22:21,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:21 BoogieIcfgContainer [2020-07-10 20:22:21,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:22:21,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:22:21,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:22:21,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:22:21,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:22:20" (1/3) ... [2020-07-10 20:22:21,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358e86e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:21, skipping insertion in model container [2020-07-10 20:22:21,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:22:21" (2/3) ... [2020-07-10 20:22:21,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@358e86e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:22:21, skipping insertion in model container [2020-07-10 20:22:21,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:22:21" (3/3) ... [2020-07-10 20:22:21,740 INFO L109 eAbstractionObserver]: Analyzing ICFG veris.c_NetBSD-libc_loop.i [2020-07-10 20:22:21,752 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:22:21,761 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:22:21,777 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:22:21,801 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:22:21,801 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:22:21,801 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:22:21,802 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:22:21,802 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:22:21,802 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:22:21,802 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:22:21,802 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:22:21,825 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-10 20:22:21,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 20:22:21,842 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:21,843 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:21,843 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:21,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:21,849 INFO L82 PathProgramCache]: Analyzing trace with hash -331406787, now seen corresponding path program 1 times [2020-07-10 20:22:21,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:21,859 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1351193347] [2020-07-10 20:22:21,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:22,473 INFO L280 TraceCheckUtils]: 0: Hoare triple {58#(and (= ~tmp~0.base |old(~tmp~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {43#true} is VALID [2020-07-10 20:22:22,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} #valid := #valid[0 := 0]; {43#true} is VALID [2020-07-10 20:22:22,474 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} assume 0 < #StackHeapBarrier; {43#true} is VALID [2020-07-10 20:22:22,475 INFO L280 TraceCheckUtils]: 3: Hoare triple {43#true} ~tmp~0.base, ~tmp~0.offset := 0, 0; {43#true} is VALID [2020-07-10 20:22:22,475 INFO L280 TraceCheckUtils]: 4: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 20:22:22,476 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {43#true} {43#true} #55#return; {43#true} is VALID [2020-07-10 20:22:22,482 INFO L263 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {58#(and (= ~tmp~0.base |old(~tmp~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:22:22,482 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#(and (= ~tmp~0.base |old(~tmp~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {43#true} is VALID [2020-07-10 20:22:22,483 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} #valid := #valid[0 := 0]; {43#true} is VALID [2020-07-10 20:22:22,483 INFO L280 TraceCheckUtils]: 3: Hoare triple {43#true} assume 0 < #StackHeapBarrier; {43#true} is VALID [2020-07-10 20:22:22,485 INFO L280 TraceCheckUtils]: 4: Hoare triple {43#true} ~tmp~0.base, ~tmp~0.offset := 0, 0; {43#true} is VALID [2020-07-10 20:22:22,486 INFO L280 TraceCheckUtils]: 5: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 20:22:22,486 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {43#true} {43#true} #55#return; {43#true} is VALID [2020-07-10 20:22:22,487 INFO L263 TraceCheckUtils]: 7: Hoare triple {43#true} call #t~ret2 := main(); {43#true} is VALID [2020-07-10 20:22:22,490 INFO L280 TraceCheckUtils]: 8: Hoare triple {43#true} SUMMARY for call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8); srcloc: mainENTRY {51#(= 0 |main_~#pathbuf~0.offset|)} is VALID [2020-07-10 20:22:22,491 INFO L280 TraceCheckUtils]: 9: Hoare triple {51#(= 0 |main_~#pathbuf~0.offset|)} ~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {51#(= 0 |main_~#pathbuf~0.offset|)} is VALID [2020-07-10 20:22:22,493 INFO L280 TraceCheckUtils]: 10: Hoare triple {51#(= 0 |main_~#pathbuf~0.offset|)} ~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {52#(and (= 0 |main_~#pathbuf~0.offset|) (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset))} is VALID [2020-07-10 20:22:22,498 INFO L263 TraceCheckUtils]: 11: Hoare triple {52#(and (= 0 |main_~#pathbuf~0.offset|) (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset))} call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {53#(and (<= 4 ~tmp~0.offset) (= ~tmp~0.base |glob2_#in~pathbuf.base|) (= 0 |glob2_#in~pathbuf.offset|))} is VALID [2020-07-10 20:22:22,502 INFO L280 TraceCheckUtils]: 12: Hoare triple {53#(and (<= 4 ~tmp~0.offset) (= ~tmp~0.base |glob2_#in~pathbuf.base|) (= 0 |glob2_#in~pathbuf.offset|))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset; {54#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} is VALID [2020-07-10 20:22:22,504 INFO L280 TraceCheckUtils]: 13: Hoare triple {54#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} ~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset; {54#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} is VALID [2020-07-10 20:22:22,506 INFO L280 TraceCheckUtils]: 14: Hoare triple {54#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} havoc ~p~0.base, ~p~0.offset; {54#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} is VALID [2020-07-10 20:22:22,508 INFO L280 TraceCheckUtils]: 15: Hoare triple {54#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} ~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {55#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-10 20:22:22,510 INFO L280 TraceCheckUtils]: 16: Hoare triple {55#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {55#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-10 20:22:22,513 INFO L263 TraceCheckUtils]: 17: Hoare triple {55#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {56#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:22,514 INFO L280 TraceCheckUtils]: 18: Hoare triple {56#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {57#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:22,515 INFO L280 TraceCheckUtils]: 19: Hoare triple {57#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {44#false} is VALID [2020-07-10 20:22:22,515 INFO L280 TraceCheckUtils]: 20: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-10 20:22:22,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:22,526 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:22,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1351193347] [2020-07-10 20:22:22,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:22,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-10 20:22:22,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005564171] [2020-07-10 20:22:22,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-07-10 20:22:22,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:22,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 20:22:22,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:22,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 20:22:22,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:22,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 20:22:22,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-10 20:22:22,619 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 10 states. [2020-07-10 20:22:24,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:24,031 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2020-07-10 20:22:24,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 20:22:24,032 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-07-10 20:22:24,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:24,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:22:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2020-07-10 20:22:24,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 20:22:24,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2020-07-10 20:22:24,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 85 transitions. [2020-07-10 20:22:24,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:24,236 INFO L225 Difference]: With dead ends: 76 [2020-07-10 20:22:24,236 INFO L226 Difference]: Without dead ends: 37 [2020-07-10 20:22:24,243 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-07-10 20:22:24,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-10 20:22:24,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2020-07-10 20:22:24,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:24,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 34 states. [2020-07-10 20:22:24,425 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 34 states. [2020-07-10 20:22:24,425 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 34 states. [2020-07-10 20:22:24,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:24,430 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-10 20:22:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2020-07-10 20:22:24,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:24,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:24,432 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 37 states. [2020-07-10 20:22:24,432 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 37 states. [2020-07-10 20:22:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:24,437 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-10 20:22:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2020-07-10 20:22:24,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:24,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:24,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:24,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-10 20:22:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2020-07-10 20:22:24,444 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 21 [2020-07-10 20:22:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:24,444 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2020-07-10 20:22:24,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 20:22:24,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2020-07-10 20:22:24,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:24,499 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-10 20:22:24,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 20:22:24,501 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:24,501 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:24,502 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:22:24,502 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:24,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:24,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1840112204, now seen corresponding path program 1 times [2020-07-10 20:22:24,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:24,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1045852863] [2020-07-10 20:22:24,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:24,835 INFO L280 TraceCheckUtils]: 0: Hoare triple {388#(and (= ~tmp~0.base |old(~tmp~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {367#true} is VALID [2020-07-10 20:22:24,836 INFO L280 TraceCheckUtils]: 1: Hoare triple {367#true} #valid := #valid[0 := 0]; {367#true} is VALID [2020-07-10 20:22:24,836 INFO L280 TraceCheckUtils]: 2: Hoare triple {367#true} assume 0 < #StackHeapBarrier; {367#true} is VALID [2020-07-10 20:22:24,836 INFO L280 TraceCheckUtils]: 3: Hoare triple {367#true} ~tmp~0.base, ~tmp~0.offset := 0, 0; {367#true} is VALID [2020-07-10 20:22:24,837 INFO L280 TraceCheckUtils]: 4: Hoare triple {367#true} assume true; {367#true} is VALID [2020-07-10 20:22:24,837 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {367#true} {367#true} #55#return; {367#true} is VALID [2020-07-10 20:22:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:24,847 INFO L280 TraceCheckUtils]: 0: Hoare triple {367#true} ~cond := #in~cond; {367#true} is VALID [2020-07-10 20:22:24,847 INFO L280 TraceCheckUtils]: 1: Hoare triple {367#true} assume !(0 == ~cond); {367#true} is VALID [2020-07-10 20:22:24,848 INFO L280 TraceCheckUtils]: 2: Hoare triple {367#true} assume true; {367#true} is VALID [2020-07-10 20:22:24,849 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {367#true} {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #53#return; {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-10 20:22:24,850 INFO L263 TraceCheckUtils]: 0: Hoare triple {367#true} call ULTIMATE.init(); {388#(and (= ~tmp~0.base |old(~tmp~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:22:24,851 INFO L280 TraceCheckUtils]: 1: Hoare triple {388#(and (= ~tmp~0.base |old(~tmp~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {367#true} is VALID [2020-07-10 20:22:24,851 INFO L280 TraceCheckUtils]: 2: Hoare triple {367#true} #valid := #valid[0 := 0]; {367#true} is VALID [2020-07-10 20:22:24,851 INFO L280 TraceCheckUtils]: 3: Hoare triple {367#true} assume 0 < #StackHeapBarrier; {367#true} is VALID [2020-07-10 20:22:24,852 INFO L280 TraceCheckUtils]: 4: Hoare triple {367#true} ~tmp~0.base, ~tmp~0.offset := 0, 0; {367#true} is VALID [2020-07-10 20:22:24,852 INFO L280 TraceCheckUtils]: 5: Hoare triple {367#true} assume true; {367#true} is VALID [2020-07-10 20:22:24,852 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {367#true} {367#true} #55#return; {367#true} is VALID [2020-07-10 20:22:24,853 INFO L263 TraceCheckUtils]: 7: Hoare triple {367#true} call #t~ret2 := main(); {367#true} is VALID [2020-07-10 20:22:24,853 INFO L280 TraceCheckUtils]: 8: Hoare triple {367#true} SUMMARY for call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8); srcloc: mainENTRY {375#(= 0 |main_~#pathbuf~0.offset|)} is VALID [2020-07-10 20:22:24,854 INFO L280 TraceCheckUtils]: 9: Hoare triple {375#(= 0 |main_~#pathbuf~0.offset|)} ~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {375#(= 0 |main_~#pathbuf~0.offset|)} is VALID [2020-07-10 20:22:24,855 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#(= 0 |main_~#pathbuf~0.offset|)} ~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {376#(and (= 0 |main_~#pathbuf~0.offset|) (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset))} is VALID [2020-07-10 20:22:24,857 INFO L263 TraceCheckUtils]: 11: Hoare triple {376#(and (= 0 |main_~#pathbuf~0.offset|) (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset))} call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {377#(and (<= 4 ~tmp~0.offset) (= ~tmp~0.base |glob2_#in~pathbuf.base|) (= 0 |glob2_#in~pathbuf.offset|))} is VALID [2020-07-10 20:22:24,858 INFO L280 TraceCheckUtils]: 12: Hoare triple {377#(and (<= 4 ~tmp~0.offset) (= ~tmp~0.base |glob2_#in~pathbuf.base|) (= 0 |glob2_#in~pathbuf.offset|))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset; {378#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} is VALID [2020-07-10 20:22:24,859 INFO L280 TraceCheckUtils]: 13: Hoare triple {378#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} ~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset; {378#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} is VALID [2020-07-10 20:22:24,861 INFO L280 TraceCheckUtils]: 14: Hoare triple {378#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} havoc ~p~0.base, ~p~0.offset; {378#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} is VALID [2020-07-10 20:22:24,862 INFO L280 TraceCheckUtils]: 15: Hoare triple {378#(and (= 0 glob2_~pathbuf.offset) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~pathbuf.base))} ~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-10 20:22:24,863 INFO L280 TraceCheckUtils]: 16: Hoare triple {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-10 20:22:24,863 INFO L263 TraceCheckUtils]: 17: Hoare triple {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {367#true} is VALID [2020-07-10 20:22:24,863 INFO L280 TraceCheckUtils]: 18: Hoare triple {367#true} ~cond := #in~cond; {367#true} is VALID [2020-07-10 20:22:24,864 INFO L280 TraceCheckUtils]: 19: Hoare triple {367#true} assume !(0 == ~cond); {367#true} is VALID [2020-07-10 20:22:24,864 INFO L280 TraceCheckUtils]: 20: Hoare triple {367#true} assume true; {367#true} is VALID [2020-07-10 20:22:24,865 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {367#true} {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #53#return; {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-10 20:22:24,867 INFO L280 TraceCheckUtils]: 22: Hoare triple {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L20-1 {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-10 20:22:24,868 INFO L280 TraceCheckUtils]: 23: Hoare triple {379#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset; {384#(and (<= 4 ~tmp~0.offset) (= |glob2_#t~post0.base| ~tmp~0.base) (= 0 |glob2_#t~post0.offset|))} is VALID [2020-07-10 20:22:24,869 INFO L280 TraceCheckUtils]: 24: Hoare triple {384#(and (<= 4 ~tmp~0.offset) (= |glob2_#t~post0.base| ~tmp~0.base) (= 0 |glob2_#t~post0.offset|))} ~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset; {385#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-10 20:22:24,870 INFO L280 TraceCheckUtils]: 25: Hoare triple {385#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} havoc #t~post0.base, #t~post0.offset; {385#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-10 20:22:24,871 INFO L280 TraceCheckUtils]: 26: Hoare triple {385#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {385#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-10 20:22:24,872 INFO L263 TraceCheckUtils]: 27: Hoare triple {385#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {386#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:22:24,873 INFO L280 TraceCheckUtils]: 28: Hoare triple {386#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {387#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:22:24,874 INFO L280 TraceCheckUtils]: 29: Hoare triple {387#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {368#false} is VALID [2020-07-10 20:22:24,874 INFO L280 TraceCheckUtils]: 30: Hoare triple {368#false} assume !false; {368#false} is VALID [2020-07-10 20:22:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:24,878 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:24,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1045852863] [2020-07-10 20:22:24,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:24,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-10 20:22:24,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564929716] [2020-07-10 20:22:24,880 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-07-10 20:22:24,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:24,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 20:22:24,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:24,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 20:22:24,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:24,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 20:22:24,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-10 20:22:24,921 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 12 states. [2020-07-10 20:22:26,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:26,151 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2020-07-10 20:22:26,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 20:22:26,151 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-07-10 20:22:26,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:26,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 20:22:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions. [2020-07-10 20:22:26,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 20:22:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions. [2020-07-10 20:22:26,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 46 transitions. [2020-07-10 20:22:26,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:26,233 INFO L225 Difference]: With dead ends: 49 [2020-07-10 20:22:26,233 INFO L226 Difference]: Without dead ends: 47 [2020-07-10 20:22:26,235 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2020-07-10 20:22:26,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-10 20:22:26,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2020-07-10 20:22:26,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:26,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 44 states. [2020-07-10 20:22:26,407 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 44 states. [2020-07-10 20:22:26,407 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 44 states. [2020-07-10 20:22:26,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:26,412 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2020-07-10 20:22:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2020-07-10 20:22:26,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:26,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:26,419 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 47 states. [2020-07-10 20:22:26,419 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 47 states. [2020-07-10 20:22:26,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:26,427 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2020-07-10 20:22:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2020-07-10 20:22:26,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:26,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:26,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:26,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-10 20:22:26,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2020-07-10 20:22:26,435 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 31 [2020-07-10 20:22:26,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:26,436 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2020-07-10 20:22:26,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 20:22:26,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2020-07-10 20:22:26,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2020-07-10 20:22:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-10 20:22:26,558 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:22:26,558 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:22:26,559 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:22:26,559 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:22:26,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:22:26,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1122821221, now seen corresponding path program 2 times [2020-07-10 20:22:26,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:22:26,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1001506283] [2020-07-10 20:22:26,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:22:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:26,888 INFO L280 TraceCheckUtils]: 0: Hoare triple {716#(and (= ~tmp~0.base |old(~tmp~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {690#true} is VALID [2020-07-10 20:22:26,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {690#true} #valid := #valid[0 := 0]; {690#true} is VALID [2020-07-10 20:22:26,889 INFO L280 TraceCheckUtils]: 2: Hoare triple {690#true} assume 0 < #StackHeapBarrier; {690#true} is VALID [2020-07-10 20:22:26,889 INFO L280 TraceCheckUtils]: 3: Hoare triple {690#true} ~tmp~0.base, ~tmp~0.offset := 0, 0; {690#true} is VALID [2020-07-10 20:22:26,889 INFO L280 TraceCheckUtils]: 4: Hoare triple {690#true} assume true; {690#true} is VALID [2020-07-10 20:22:26,890 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {690#true} {690#true} #55#return; {690#true} is VALID [2020-07-10 20:22:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:26,901 INFO L280 TraceCheckUtils]: 0: Hoare triple {690#true} ~cond := #in~cond; {690#true} is VALID [2020-07-10 20:22:26,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {690#true} assume !(0 == ~cond); {690#true} is VALID [2020-07-10 20:22:26,902 INFO L280 TraceCheckUtils]: 2: Hoare triple {690#true} assume true; {690#true} is VALID [2020-07-10 20:22:26,903 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {690#true} {703#(and (= 0 glob2_~p~0.offset) (<= glob2_~pathlim.offset 4))} #53#return; {703#(and (= 0 glob2_~p~0.offset) (<= glob2_~pathlim.offset 4))} is VALID [2020-07-10 20:22:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:22:26,919 INFO L280 TraceCheckUtils]: 0: Hoare triple {690#true} ~cond := #in~cond; {690#true} is VALID [2020-07-10 20:22:26,919 INFO L280 TraceCheckUtils]: 1: Hoare triple {690#true} assume !(0 == ~cond); {690#true} is VALID [2020-07-10 20:22:26,920 INFO L280 TraceCheckUtils]: 2: Hoare triple {690#true} assume true; {690#true} is VALID [2020-07-10 20:22:26,925 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {690#true} {709#(<= glob2_~pathlim.offset glob2_~p~0.offset)} #53#return; {709#(<= glob2_~pathlim.offset glob2_~p~0.offset)} is VALID [2020-07-10 20:22:26,926 INFO L263 TraceCheckUtils]: 0: Hoare triple {690#true} call ULTIMATE.init(); {716#(and (= ~tmp~0.base |old(~tmp~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 20:22:26,926 INFO L280 TraceCheckUtils]: 1: Hoare triple {716#(and (= ~tmp~0.base |old(~tmp~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {690#true} is VALID [2020-07-10 20:22:26,927 INFO L280 TraceCheckUtils]: 2: Hoare triple {690#true} #valid := #valid[0 := 0]; {690#true} is VALID [2020-07-10 20:22:26,927 INFO L280 TraceCheckUtils]: 3: Hoare triple {690#true} assume 0 < #StackHeapBarrier; {690#true} is VALID [2020-07-10 20:22:26,927 INFO L280 TraceCheckUtils]: 4: Hoare triple {690#true} ~tmp~0.base, ~tmp~0.offset := 0, 0; {690#true} is VALID [2020-07-10 20:22:26,927 INFO L280 TraceCheckUtils]: 5: Hoare triple {690#true} assume true; {690#true} is VALID [2020-07-10 20:22:26,928 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {690#true} {690#true} #55#return; {690#true} is VALID [2020-07-10 20:22:26,928 INFO L263 TraceCheckUtils]: 7: Hoare triple {690#true} call #t~ret2 := main(); {690#true} is VALID [2020-07-10 20:22:26,940 INFO L280 TraceCheckUtils]: 8: Hoare triple {690#true} SUMMARY for call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8); srcloc: mainENTRY {698#(= 0 |main_~#pathbuf~0.offset|)} is VALID [2020-07-10 20:22:26,943 INFO L280 TraceCheckUtils]: 9: Hoare triple {698#(= 0 |main_~#pathbuf~0.offset|)} ~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {699#(and (= 0 |main_~#pathbuf~0.offset|) (<= main_~bound~0.offset (+ |main_~#pathbuf~0.offset| 4)))} is VALID [2020-07-10 20:22:26,944 INFO L280 TraceCheckUtils]: 10: Hoare triple {699#(and (= 0 |main_~#pathbuf~0.offset|) (<= main_~bound~0.offset (+ |main_~#pathbuf~0.offset| 4)))} ~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {699#(and (= 0 |main_~#pathbuf~0.offset|) (<= main_~bound~0.offset (+ |main_~#pathbuf~0.offset| 4)))} is VALID [2020-07-10 20:22:26,946 INFO L263 TraceCheckUtils]: 11: Hoare triple {699#(and (= 0 |main_~#pathbuf~0.offset|) (<= main_~bound~0.offset (+ |main_~#pathbuf~0.offset| 4)))} call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {700#(and (<= |glob2_#in~pathlim.offset| 4) (= 0 |glob2_#in~pathbuf.offset|))} is VALID [2020-07-10 20:22:26,947 INFO L280 TraceCheckUtils]: 12: Hoare triple {700#(and (<= |glob2_#in~pathlim.offset| 4) (= 0 |glob2_#in~pathbuf.offset|))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset; {701#(and (= 0 glob2_~pathbuf.offset) (<= |glob2_#in~pathlim.offset| 4))} is VALID [2020-07-10 20:22:26,948 INFO L280 TraceCheckUtils]: 13: Hoare triple {701#(and (= 0 glob2_~pathbuf.offset) (<= |glob2_#in~pathlim.offset| 4))} ~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset; {702#(and (= 0 glob2_~pathbuf.offset) (<= glob2_~pathlim.offset 4))} is VALID [2020-07-10 20:22:26,948 INFO L280 TraceCheckUtils]: 14: Hoare triple {702#(and (= 0 glob2_~pathbuf.offset) (<= glob2_~pathlim.offset 4))} havoc ~p~0.base, ~p~0.offset; {702#(and (= 0 glob2_~pathbuf.offset) (<= glob2_~pathlim.offset 4))} is VALID [2020-07-10 20:22:26,949 INFO L280 TraceCheckUtils]: 15: Hoare triple {702#(and (= 0 glob2_~pathbuf.offset) (<= glob2_~pathlim.offset 4))} ~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {703#(and (= 0 glob2_~p~0.offset) (<= glob2_~pathlim.offset 4))} is VALID [2020-07-10 20:22:26,950 INFO L280 TraceCheckUtils]: 16: Hoare triple {703#(and (= 0 glob2_~p~0.offset) (<= glob2_~pathlim.offset 4))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {703#(and (= 0 glob2_~p~0.offset) (<= glob2_~pathlim.offset 4))} is VALID [2020-07-10 20:22:26,950 INFO L263 TraceCheckUtils]: 17: Hoare triple {703#(and (= 0 glob2_~p~0.offset) (<= glob2_~pathlim.offset 4))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {690#true} is VALID [2020-07-10 20:22:26,950 INFO L280 TraceCheckUtils]: 18: Hoare triple {690#true} ~cond := #in~cond; {690#true} is VALID [2020-07-10 20:22:26,950 INFO L280 TraceCheckUtils]: 19: Hoare triple {690#true} assume !(0 == ~cond); {690#true} is VALID [2020-07-10 20:22:26,951 INFO L280 TraceCheckUtils]: 20: Hoare triple {690#true} assume true; {690#true} is VALID [2020-07-10 20:22:26,951 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {690#true} {703#(and (= 0 glob2_~p~0.offset) (<= glob2_~pathlim.offset 4))} #53#return; {703#(and (= 0 glob2_~p~0.offset) (<= glob2_~pathlim.offset 4))} is VALID [2020-07-10 20:22:26,954 INFO L280 TraceCheckUtils]: 22: Hoare triple {703#(and (= 0 glob2_~p~0.offset) (<= glob2_~pathlim.offset 4))} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L20-1 {703#(and (= 0 glob2_~p~0.offset) (<= glob2_~pathlim.offset 4))} is VALID [2020-07-10 20:22:26,955 INFO L280 TraceCheckUtils]: 23: Hoare triple {703#(and (= 0 glob2_~p~0.offset) (<= glob2_~pathlim.offset 4))} #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset; {708#(and (= 0 |glob2_#t~post0.offset|) (<= glob2_~pathlim.offset 4))} is VALID [2020-07-10 20:22:26,956 INFO L280 TraceCheckUtils]: 24: Hoare triple {708#(and (= 0 |glob2_#t~post0.offset|) (<= glob2_~pathlim.offset 4))} ~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset; {709#(<= glob2_~pathlim.offset glob2_~p~0.offset)} is VALID [2020-07-10 20:22:26,957 INFO L280 TraceCheckUtils]: 25: Hoare triple {709#(<= glob2_~pathlim.offset glob2_~p~0.offset)} havoc #t~post0.base, #t~post0.offset; {709#(<= glob2_~pathlim.offset glob2_~p~0.offset)} is VALID [2020-07-10 20:22:26,957 INFO L280 TraceCheckUtils]: 26: Hoare triple {709#(<= glob2_~pathlim.offset glob2_~p~0.offset)} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {709#(<= glob2_~pathlim.offset glob2_~p~0.offset)} is VALID [2020-07-10 20:22:26,957 INFO L263 TraceCheckUtils]: 27: Hoare triple {709#(<= glob2_~pathlim.offset glob2_~p~0.offset)} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {690#true} is VALID [2020-07-10 20:22:26,958 INFO L280 TraceCheckUtils]: 28: Hoare triple {690#true} ~cond := #in~cond; {690#true} is VALID [2020-07-10 20:22:26,958 INFO L280 TraceCheckUtils]: 29: Hoare triple {690#true} assume !(0 == ~cond); {690#true} is VALID [2020-07-10 20:22:26,958 INFO L280 TraceCheckUtils]: 30: Hoare triple {690#true} assume true; {690#true} is VALID [2020-07-10 20:22:26,959 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {690#true} {709#(<= glob2_~pathlim.offset glob2_~p~0.offset)} #53#return; {709#(<= glob2_~pathlim.offset glob2_~p~0.offset)} is VALID [2020-07-10 20:22:26,960 INFO L280 TraceCheckUtils]: 32: Hoare triple {709#(<= glob2_~pathlim.offset glob2_~p~0.offset)} SUMMARY for call write~int(1, ~p~0.base, ~p~0.offset, 4); srcloc: L20-1 {709#(<= glob2_~pathlim.offset glob2_~p~0.offset)} is VALID [2020-07-10 20:22:26,960 INFO L280 TraceCheckUtils]: 33: Hoare triple {709#(<= glob2_~pathlim.offset glob2_~p~0.offset)} #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset; {714#(<= glob2_~pathlim.offset |glob2_#t~post0.offset|)} is VALID [2020-07-10 20:22:26,961 INFO L280 TraceCheckUtils]: 34: Hoare triple {714#(<= glob2_~pathlim.offset |glob2_#t~post0.offset|)} ~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset; {715#(<= (+ glob2_~pathlim.offset 4) glob2_~p~0.offset)} is VALID [2020-07-10 20:22:26,962 INFO L280 TraceCheckUtils]: 35: Hoare triple {715#(<= (+ glob2_~pathlim.offset 4) glob2_~p~0.offset)} havoc #t~post0.base, #t~post0.offset; {715#(<= (+ glob2_~pathlim.offset 4) glob2_~p~0.offset)} is VALID [2020-07-10 20:22:26,962 INFO L280 TraceCheckUtils]: 36: Hoare triple {715#(<= (+ glob2_~pathlim.offset 4) glob2_~p~0.offset)} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {691#false} is VALID [2020-07-10 20:22:26,962 INFO L263 TraceCheckUtils]: 37: Hoare triple {691#false} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {691#false} is VALID [2020-07-10 20:22:26,963 INFO L280 TraceCheckUtils]: 38: Hoare triple {691#false} ~cond := #in~cond; {691#false} is VALID [2020-07-10 20:22:26,963 INFO L280 TraceCheckUtils]: 39: Hoare triple {691#false} assume 0 == ~cond; {691#false} is VALID [2020-07-10 20:22:26,963 INFO L280 TraceCheckUtils]: 40: Hoare triple {691#false} assume !false; {691#false} is VALID [2020-07-10 20:22:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:22:26,967 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:22:26,968 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1001506283] [2020-07-10 20:22:26,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:22:26,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-10 20:22:26,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125077620] [2020-07-10 20:22:26,969 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2020-07-10 20:22:26,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:22:26,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 20:22:27,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:27,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 20:22:27,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:22:27,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 20:22:27,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-07-10 20:22:27,011 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 13 states. [2020-07-10 20:22:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:28,177 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2020-07-10 20:22:28,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 20:22:28,178 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2020-07-10 20:22:28,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:22:28,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 20:22:28,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2020-07-10 20:22:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 20:22:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 46 transitions. [2020-07-10 20:22:28,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 46 transitions. [2020-07-10 20:22:28,251 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:28,252 INFO L225 Difference]: With dead ends: 49 [2020-07-10 20:22:28,252 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:22:28,253 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2020-07-10 20:22:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:22:28,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:22:28,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:22:28,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:28,254 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:28,254 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:28,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:28,255 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:22:28,255 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:28,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:28,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:28,256 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:28,256 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:22:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:22:28,256 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:22:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:28,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:28,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:22:28,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:22:28,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:22:28,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:22:28,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:22:28,258 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2020-07-10 20:22:28,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:22:28,258 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:22:28,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 20:22:28,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:22:28,258 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:22:28,259 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:22:28,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:22:28,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:22:28,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:22:28,966 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2020-07-10 20:22:29,085 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2020-07-10 20:22:29,552 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2020-07-10 20:22:29,558 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:22:29,558 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-10 20:22:29,559 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:22:29,559 INFO L271 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-07-10 20:22:29,559 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~tmp~0.base |old(~tmp~0.base)|) (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-10 20:22:29,559 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:22:29,559 INFO L271 CegarLoopResult]: At program point glob2ENTRY(lines 14 25) the Hoare annotation is: true [2020-07-10 20:22:29,560 INFO L264 CegarLoopResult]: At program point L21(lines 18 22) the Hoare annotation is: (let ((.cse0 (= 0 glob2_~pathbuf.offset)) (.cse1 (= ~tmp~0.base glob2_~pathbuf.base)) (.cse2 (<= glob2_~pathlim.offset 4))) (or (not (<= 4 ~tmp~0.offset)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (not (= 0 |glob2_#in~pathbuf.offset|)) (not (<= |glob2_#in~pathlim.offset| 4)) (and .cse0 .cse1 (= 0 glob2_~p~0.offset) .cse2 (= ~tmp~0.base glob2_~p~0.base)) (and .cse0 .cse1 .cse2 (<= glob2_~pathlim.offset glob2_~p~0.offset)))) [2020-07-10 20:22:29,560 INFO L264 CegarLoopResult]: At program point glob2EXIT(lines 14 25) the Hoare annotation is: (or (not (<= 4 ~tmp~0.offset)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (not (= 0 |glob2_#in~pathbuf.offset|)) (not (<= |glob2_#in~pathlim.offset| 4)) (and (= 0 glob2_~pathbuf.offset) (= ~tmp~0.base glob2_~pathbuf.base))) [2020-07-10 20:22:29,560 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (let ((.cse0 (= 0 glob2_~pathbuf.offset)) (.cse1 (= ~tmp~0.base glob2_~pathbuf.base)) (.cse2 (<= glob2_~pathlim.offset 4)) (.cse3 (= ~tmp~0.base glob2_~p~0.base))) (or (not (<= 4 ~tmp~0.offset)) (and .cse0 .cse1 (<= glob2_~p~0.offset ~tmp~0.offset) .cse2 (<= glob2_~pathlim.offset glob2_~p~0.offset) .cse3) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (not (= 0 |glob2_#in~pathbuf.offset|)) (not (<= |glob2_#in~pathlim.offset| 4)) (and .cse0 .cse1 (= 0 glob2_~p~0.offset) .cse2 .cse3))) [2020-07-10 20:22:29,561 INFO L264 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse0 (= 0 glob2_~pathbuf.offset)) (.cse1 (= ~tmp~0.base glob2_~pathbuf.base)) (.cse2 (<= glob2_~pathlim.offset 4))) (or (not (<= 4 ~tmp~0.offset)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (not (= 0 |glob2_#in~pathbuf.offset|)) (not (<= |glob2_#in~pathlim.offset| 4)) (and .cse0 .cse1 (= 0 glob2_~p~0.offset) .cse2 (= ~tmp~0.base glob2_~p~0.base)) (and .cse0 .cse1 .cse2 (<= glob2_~pathlim.offset glob2_~p~0.offset)))) [2020-07-10 20:22:29,561 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (or (not (<= 4 ~tmp~0.offset)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (not (= 0 |glob2_#in~pathbuf.offset|)) (and (= 0 glob2_~pathbuf.offset) (= ~tmp~0.base glob2_~pathbuf.base) (<= glob2_~pathlim.offset 4)) (not (<= |glob2_#in~pathlim.offset| 4))) [2020-07-10 20:22:29,561 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (or (not (<= 4 ~tmp~0.offset)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (not (= 0 |glob2_#in~pathbuf.offset|)) (and (= 0 glob2_~pathbuf.offset) (= ~tmp~0.base glob2_~pathbuf.base) (<= glob2_~pathlim.offset 4)) (not (<= |glob2_#in~pathlim.offset| 4))) [2020-07-10 20:22:29,561 INFO L264 CegarLoopResult]: At program point L18-3(line 18) the Hoare annotation is: (let ((.cse0 (= 0 glob2_~pathbuf.offset)) (.cse1 (= ~tmp~0.base glob2_~pathbuf.base)) (.cse2 (<= glob2_~pathlim.offset 4))) (or (not (<= 4 ~tmp~0.offset)) (and .cse0 .cse1 (= 0 glob2_~p~0.offset) (= |glob2_#t~post0.base| ~tmp~0.base) (= 0 |glob2_#t~post0.offset|) .cse2 (= ~tmp~0.base glob2_~p~0.base)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (not (= 0 |glob2_#in~pathbuf.offset|)) (not (<= |glob2_#in~pathlim.offset| 4)) (and .cse0 .cse1 (<= glob2_~pathlim.offset |glob2_#t~post0.offset|) .cse2 (<= glob2_~pathlim.offset glob2_~p~0.offset)))) [2020-07-10 20:22:29,562 INFO L264 CegarLoopResult]: At program point L14(lines 14 25) the Hoare annotation is: (or (not (<= 4 ~tmp~0.offset)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (not (= 0 |glob2_#in~pathbuf.offset|)) (not (<= |glob2_#in~pathlim.offset| 4)) (and (= 0 glob2_~pathbuf.offset) (= ~tmp~0.base glob2_~pathbuf.base))) [2020-07-10 20:22:29,562 INFO L264 CegarLoopResult]: At program point L18-4(line 18) the Hoare annotation is: (let ((.cse0 (= 0 glob2_~pathbuf.offset)) (.cse1 (= ~tmp~0.base glob2_~pathbuf.base)) (.cse2 (<= glob2_~pathlim.offset 4))) (or (not (<= 4 ~tmp~0.offset)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (not (= 0 |glob2_#in~pathbuf.offset|)) (not (<= |glob2_#in~pathlim.offset| 4)) (and .cse0 .cse1 (<= glob2_~p~0.offset ~tmp~0.offset) (= |glob2_#t~post0.base| ~tmp~0.base) (= 0 |glob2_#t~post0.offset|) .cse2 (<= glob2_~pathlim.offset glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base)) (and .cse0 .cse1 (<= (+ glob2_~pathlim.offset 4) glob2_~p~0.offset) (<= glob2_~pathlim.offset |glob2_#t~post0.offset|) .cse2))) [2020-07-10 20:22:29,562 INFO L264 CegarLoopResult]: At program point L18-5(lines 18 22) the Hoare annotation is: (let ((.cse0 (= 0 glob2_~pathbuf.offset)) (.cse1 (= ~tmp~0.base glob2_~pathbuf.base)) (.cse2 (<= glob2_~pathlim.offset 4)) (.cse3 (= ~tmp~0.base glob2_~p~0.base))) (or (not (<= 4 ~tmp~0.offset)) (and .cse0 .cse1 (<= glob2_~p~0.offset ~tmp~0.offset) .cse2 (<= glob2_~pathlim.offset glob2_~p~0.offset) .cse3) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (and .cse0 .cse1 (<= (+ glob2_~pathlim.offset 4) glob2_~p~0.offset) .cse2) (not (= 0 |glob2_#in~pathbuf.offset|)) (not (<= |glob2_#in~pathlim.offset| 4)) (and .cse0 .cse1 (= 0 glob2_~p~0.offset) .cse2 .cse3))) [2020-07-10 20:22:29,562 INFO L264 CegarLoopResult]: At program point L18-6(lines 18 22) the Hoare annotation is: (or (not (<= 4 ~tmp~0.offset)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (not (= 0 |glob2_#in~pathbuf.offset|)) (not (<= |glob2_#in~pathlim.offset| 4)) (and (= 0 glob2_~pathbuf.offset) (= ~tmp~0.base glob2_~pathbuf.base))) [2020-07-10 20:22:29,562 INFO L264 CegarLoopResult]: At program point glob2FINAL(lines 14 25) the Hoare annotation is: (or (not (<= 4 ~tmp~0.offset)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (not (= 0 |glob2_#in~pathbuf.offset|)) (not (<= |glob2_#in~pathlim.offset| 4)) (and (= 0 glob2_~pathbuf.offset) (= ~tmp~0.base glob2_~pathbuf.base))) [2020-07-10 20:22:29,562 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:22:29,563 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:22:29,563 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:22:29,563 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:22:29,563 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (and (= 0 |main_~#pathbuf~0.offset|) (<= main_~bound~0.offset (+ |main_~#pathbuf~0.offset| 4))) [2020-07-10 20:22:29,563 INFO L264 CegarLoopResult]: At program point L35-2(line 35) the Hoare annotation is: (and (= 0 |main_~#pathbuf~0.offset|) (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset)) [2020-07-10 20:22:29,564 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 27 38) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base)) [2020-07-10 20:22:29,564 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (= 0 |main_~#pathbuf~0.offset|) [2020-07-10 20:22:29,564 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 27 38) the Hoare annotation is: true [2020-07-10 20:22:29,564 INFO L264 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: (and (= 0 |main_~#pathbuf~0.offset|) (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset)) [2020-07-10 20:22:29,564 INFO L264 CegarLoopResult]: At program point L29-2(line 29) the Hoare annotation is: (and (= 0 |main_~#pathbuf~0.offset|) (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset)) [2020-07-10 20:22:29,564 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 27 38) the Hoare annotation is: true [2020-07-10 20:22:29,565 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (= 0 |main_~#pathbuf~0.offset|) (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset)) [2020-07-10 20:22:29,565 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (+ |main_~#pathbuf~0.offset| 4))) (and (= 0 |main_~#pathbuf~0.offset|) (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= main_~bound~0.offset .cse0) (<= .cse0 ~tmp~0.offset))) [2020-07-10 20:22:29,565 INFO L264 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (and (= 0 |main_~#pathbuf~0.offset|) (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset)) [2020-07-10 20:22:29,565 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-10 20:22:29,565 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 3 8) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:22:29,566 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:22:29,566 INFO L264 CegarLoopResult]: At program point L4(lines 4 6) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:22:29,566 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:22:29,566 INFO L264 CegarLoopResult]: At program point L4-2(lines 3 8) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:22:29,597 INFO L163 areAnnotationChecker]: CFG has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 20:22:29,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:22:29 BoogieIcfgContainer [2020-07-10 20:22:29,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:22:29,618 INFO L168 Benchmark]: Toolchain (without parser) took 8741.85 ms. Allocated memory was 137.4 MB in the beginning and 306.2 MB in the end (delta: 168.8 MB). Free memory was 101.7 MB in the beginning and 104.5 MB in the end (delta: -2.8 MB). Peak memory consumption was 166.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:29,619 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 20:22:29,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.64 ms. Allocated memory is still 137.4 MB. Free memory was 101.5 MB in the beginning and 91.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:29,620 INFO L168 Benchmark]: Boogie Preprocessor took 152.88 ms. Allocated memory was 137.4 MB in the beginning and 202.9 MB in the end (delta: 65.5 MB). Free memory was 91.3 MB in the beginning and 180.0 MB in the end (delta: -88.7 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:29,621 INFO L168 Benchmark]: RCFGBuilder took 403.42 ms. Allocated memory is still 202.9 MB. Free memory was 180.0 MB in the beginning and 158.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:29,622 INFO L168 Benchmark]: TraceAbstraction took 7881.39 ms. Allocated memory was 202.9 MB in the beginning and 306.2 MB in the end (delta: 103.3 MB). Free memory was 157.8 MB in the beginning and 104.5 MB in the end (delta: 53.3 MB). Peak memory consumption was 156.6 MB. Max. memory is 7.1 GB. [2020-07-10 20:22:29,627 INFO L336 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.20 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 298.64 ms. Allocated memory is still 137.4 MB. Free memory was 101.5 MB in the beginning and 91.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 152.88 ms. Allocated memory was 137.4 MB in the beginning and 202.9 MB in the end (delta: 65.5 MB). Free memory was 91.3 MB in the beginning and 180.0 MB in the end (delta: -88.7 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 403.42 ms. Allocated memory is still 202.9 MB. Free memory was 180.0 MB in the beginning and 158.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7881.39 ms. Allocated memory was 202.9 MB in the beginning and 306.2 MB in the end (delta: 103.3 MB). Free memory was 157.8 MB in the beginning and 104.5 MB in the end (delta: 53.3 MB). Peak memory consumption was 156.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((((!(4 <= tmp) || (((((0 == pathbuf && tmp == pathbuf) && p <= tmp) && pathlim <= 4) && pathlim <= p) && tmp == p)) || !(tmp == pathbuf)) || (((0 == pathbuf && tmp == pathbuf) && pathlim + 4 <= p) && pathlim <= 4)) || !(0 == pathbuf)) || !(pathlim <= 4)) || ((((0 == pathbuf && tmp == pathbuf) && 0 == p) && pathlim <= 4) && tmp == p) - ProcedureContractResult [Line: 14]: Procedure Contract for glob2 Derived contract for procedure glob2: (((!(4 <= tmp) || !(tmp == pathbuf)) || !(0 == pathbuf)) || !(pathlim <= 4)) || (0 == pathbuf && tmp == pathbuf) - ProcedureContractResult [Line: 27]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 3]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.4s, OverallIterations: 3, TraceHistogramMax: 3, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 59 SDtfs, 201 SDslu, 242 SDs, 0 SdLazy, 434 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 40 LocationsWithAnnotation, 58 PreInvPairs, 90 NumberOfFragments, 634 HoareAnnotationTreeSize, 58 FomulaSimplifications, 915 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 40 FomulaSimplificationsInter, 637 FormulaSimplificationTreeSizeReductionInter, 1.0s 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...