/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:46:11,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:46:11,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:46:11,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:46:11,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:46:11,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:46:11,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:46:11,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:46:11,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:46:11,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:46:11,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:46:11,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:46:11,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:46:11,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:46:11,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:46:11,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:46:11,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:46:11,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:46:11,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:46:11,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:46:11,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:46:11,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:46:11,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:46:11,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:46:11,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:46:11,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:46:11,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:46:11,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:46:11,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:46:11,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:46:11,374 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:46:11,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:46:11,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:46:11,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:46:11,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:46:11,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:46:11,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:46:11,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:46:11,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:46:11,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:46:11,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:46:11,382 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:46:11,423 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:46:11,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:46:11,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:46:11,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:46:11,428 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:46:11,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:46:11,429 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:46:11,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:46:11,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:46:11,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:46:11,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:46:11,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:46:11,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:46:11,430 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:46:11,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:46:11,430 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:46:11,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:46:11,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:46:11,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:46:11,434 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:46:11,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:46:11,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:46:11,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:46:11,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:46:11,435 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:46:11,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:46:11,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:46:11,436 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:46:11,436 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:46:11,436 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:46:11,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:46:11,739 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:46:11,743 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:46:11,744 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:46:11,744 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:46:11,745 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-08 12:46:11,834 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf97f9bb9/6325083f18974fc98878fbe7bc027991/FLAGc403a1a52 [2020-07-08 12:46:12,407 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:46:12,408 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i [2020-07-08 12:46:12,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf97f9bb9/6325083f18974fc98878fbe7bc027991/FLAGc403a1a52 [2020-07-08 12:46:12,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf97f9bb9/6325083f18974fc98878fbe7bc027991 [2020-07-08 12:46:12,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:46:12,765 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:46:12,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:46:12,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:46:12,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:46:12,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:46:12" (1/1) ... [2020-07-08 12:46:12,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce259d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:12, skipping insertion in model container [2020-07-08 12:46:12,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:46:12" (1/1) ... [2020-07-08 12:46:12,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:46:12,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:46:13,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:46:13,058 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:46:13,077 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:46:13,096 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:46:13,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13 WrapperNode [2020-07-08 12:46:13,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:46:13,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:46:13,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:46:13,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:46:13,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13" (1/1) ... [2020-07-08 12:46:13,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13" (1/1) ... [2020-07-08 12:46:13,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13" (1/1) ... [2020-07-08 12:46:13,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13" (1/1) ... [2020-07-08 12:46:13,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13" (1/1) ... [2020-07-08 12:46:13,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13" (1/1) ... [2020-07-08 12:46:13,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13" (1/1) ... [2020-07-08 12:46:13,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:46:13,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:46:13,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:46:13,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:46:13,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13" (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-08 12:46:13,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:46:13,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:46:13,309 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:46:13,309 INFO L138 BoogieDeclarations]: Found implementation of procedure glob2 [2020-07-08 12:46:13,310 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:46:13,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:46:13,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:46:13,310 INFO L130 BoogieDeclarations]: Found specification of procedure glob2 [2020-07-08 12:46:13,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:46:13,310 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:46:13,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 12:46:13,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:46:13,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:46:13,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:46:13,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:46:13,646 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:46:13,646 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 12:46:13,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:46:13 BoogieIcfgContainer [2020-07-08 12:46:13,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:46:13,653 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:46:13,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:46:13,657 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:46:13,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:46:12" (1/3) ... [2020-07-08 12:46:13,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334e3d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:46:13, skipping insertion in model container [2020-07-08 12:46:13,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:13" (2/3) ... [2020-07-08 12:46:13,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334e3d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:46:13, skipping insertion in model container [2020-07-08 12:46:13,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:46:13" (3/3) ... [2020-07-08 12:46:13,661 INFO L109 eAbstractionObserver]: Analyzing ICFG veris.c_NetBSD-libc_loop.i [2020-07-08 12:46:13,672 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:46:13,682 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:46:13,697 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:46:13,723 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:46:13,723 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:46:13,723 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:46:13,724 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:46:13,724 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:46:13,724 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:46:13,725 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:46:13,725 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:46:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-07-08 12:46:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-08 12:46:13,763 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:13,764 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:13,765 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:13,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:13,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1626450083, now seen corresponding path program 1 times [2020-07-08 12:46:13,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:13,781 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379641393] [2020-07-08 12:46:13,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:14,227 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp~0.base, ~tmp~0.offset := 0, 0; {29#true} is VALID [2020-07-08 12:46:14,228 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-08 12:46:14,229 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #41#return; {29#true} is VALID [2020-07-08 12:46:14,234 INFO L263 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {39#(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-08 12:46:14,235 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp~0.base, ~tmp~0.offset := 0, 0; {29#true} is VALID [2020-07-08 12:46:14,235 INFO L280 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-08 12:46:14,236 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #41#return; {29#true} is VALID [2020-07-08 12:46:14,236 INFO L263 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret2 := main(); {29#true} is VALID [2020-07-08 12:46:14,239 INFO L280 TraceCheckUtils]: 5: Hoare triple {29#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {34#(and (= 0 |main_~#pathbuf~0.offset|) (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset))} is VALID [2020-07-08 12:46:14,243 INFO L263 TraceCheckUtils]: 6: Hoare triple {34#(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); {35#(and (<= 4 ~tmp~0.offset) (= ~tmp~0.base |glob2_#in~pathbuf.base|) (= 0 |glob2_#in~pathbuf.offset|))} is VALID [2020-07-08 12:46:14,245 INFO L280 TraceCheckUtils]: 7: Hoare triple {35#(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;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {36#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:14,247 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#(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); {36#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:14,250 INFO L263 TraceCheckUtils]: 9: Hoare triple {36#(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)); {37#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:46:14,251 INFO L280 TraceCheckUtils]: 10: Hoare triple {37#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {38#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:46:14,252 INFO L280 TraceCheckUtils]: 11: Hoare triple {38#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {30#false} is VALID [2020-07-08 12:46:14,253 INFO L280 TraceCheckUtils]: 12: Hoare triple {30#false} assume !false; {30#false} is VALID [2020-07-08 12:46:14,256 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-08 12:46:14,257 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379641393] [2020-07-08 12:46:14,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:14,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 12:46:14,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799330593] [2020-07-08 12:46:14,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-07-08 12:46:14,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:14,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:46:14,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:14,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:46:14,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:14,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:46:14,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:46:14,322 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 8 states. [2020-07-08 12:46:15,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:15,223 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2020-07-08 12:46:15,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:46:15,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-07-08 12:46:15,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:46:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2020-07-08 12:46:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:46:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2020-07-08 12:46:15,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2020-07-08 12:46:15,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:15,401 INFO L225 Difference]: With dead ends: 55 [2020-07-08 12:46:15,402 INFO L226 Difference]: Without dead ends: 26 [2020-07-08 12:46:15,411 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-07-08 12:46:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-08 12:46:15,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-08 12:46:15,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:15,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2020-07-08 12:46:15,525 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2020-07-08 12:46:15,525 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2020-07-08 12:46:15,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:15,535 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-08 12:46:15,535 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-08 12:46:15,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:15,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:15,538 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2020-07-08 12:46:15,538 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2020-07-08 12:46:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:15,547 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-08 12:46:15,547 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-08 12:46:15,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:15,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:15,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:15,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-08 12:46:15,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2020-07-08 12:46:15,564 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 13 [2020-07-08 12:46:15,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:15,566 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2020-07-08 12:46:15,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 12:46:15,567 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-08 12:46:15,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 12:46:15,569 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:15,570 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:15,572 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:46:15,572 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:15,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:15,574 INFO L82 PathProgramCache]: Analyzing trace with hash -519824651, now seen corresponding path program 1 times [2020-07-08 12:46:15,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:15,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809380275] [2020-07-08 12:46:15,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:15,965 INFO L280 TraceCheckUtils]: 0: Hoare triple {225#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp~0.base, ~tmp~0.offset := 0, 0; {210#true} is VALID [2020-07-08 12:46:15,966 INFO L280 TraceCheckUtils]: 1: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-08 12:46:15,966 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {210#true} {210#true} #41#return; {210#true} is VALID [2020-07-08 12:46:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:15,994 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} ~cond := #in~cond; {210#true} is VALID [2020-07-08 12:46:15,995 INFO L280 TraceCheckUtils]: 1: Hoare triple {210#true} assume !(0 == ~cond); {210#true} is VALID [2020-07-08 12:46:15,995 INFO L280 TraceCheckUtils]: 2: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-08 12:46:15,998 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {210#true} {217#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #39#return; {217#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:16,000 INFO L263 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {225#(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-08 12:46:16,000 INFO L280 TraceCheckUtils]: 1: Hoare triple {225#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp~0.base, ~tmp~0.offset := 0, 0; {210#true} is VALID [2020-07-08 12:46:16,001 INFO L280 TraceCheckUtils]: 2: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-08 12:46:16,001 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} #41#return; {210#true} is VALID [2020-07-08 12:46:16,001 INFO L263 TraceCheckUtils]: 4: Hoare triple {210#true} call #t~ret2 := main(); {210#true} is VALID [2020-07-08 12:46:16,003 INFO L280 TraceCheckUtils]: 5: Hoare triple {210#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {215#(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-08 12:46:16,005 INFO L263 TraceCheckUtils]: 6: Hoare triple {215#(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); {216#(and (<= 4 ~tmp~0.offset) (= ~tmp~0.base |glob2_#in~pathbuf.base|) (= 0 |glob2_#in~pathbuf.offset|))} is VALID [2020-07-08 12:46:16,007 INFO L280 TraceCheckUtils]: 7: Hoare triple {216#(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;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {217#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:16,008 INFO L280 TraceCheckUtils]: 8: Hoare triple {217#(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); {217#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:16,008 INFO L263 TraceCheckUtils]: 9: Hoare triple {217#(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)); {210#true} is VALID [2020-07-08 12:46:16,009 INFO L280 TraceCheckUtils]: 10: Hoare triple {210#true} ~cond := #in~cond; {210#true} is VALID [2020-07-08 12:46:16,009 INFO L280 TraceCheckUtils]: 11: Hoare triple {210#true} assume !(0 == ~cond); {210#true} is VALID [2020-07-08 12:46:16,009 INFO L280 TraceCheckUtils]: 12: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-08 12:46:16,011 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {210#true} {217#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #39#return; {217#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:16,012 INFO L280 TraceCheckUtils]: 14: Hoare triple {217#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {217#(and (<= 4 ~tmp~0.offset) (= 0 glob2_~p~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:16,013 INFO L280 TraceCheckUtils]: 15: Hoare triple {217#(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;~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset;havoc #t~post0.base, #t~post0.offset; {222#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:16,014 INFO L280 TraceCheckUtils]: 16: Hoare triple {222#(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); {222#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:16,015 INFO L263 TraceCheckUtils]: 17: Hoare triple {222#(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)); {223#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:46:16,016 INFO L280 TraceCheckUtils]: 18: Hoare triple {223#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {224#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:46:16,017 INFO L280 TraceCheckUtils]: 19: Hoare triple {224#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {211#false} is VALID [2020-07-08 12:46:16,018 INFO L280 TraceCheckUtils]: 20: Hoare triple {211#false} assume !false; {211#false} is VALID [2020-07-08 12:46:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:16,020 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809380275] [2020-07-08 12:46:16,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559656109] [2020-07-08 12:46:16,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:16,093 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-08 12:46:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:16,119 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:16,318 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:16,371 INFO L263 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2020-07-08 12:46:16,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {210#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp~0.base, ~tmp~0.offset := 0, 0; {210#true} is VALID [2020-07-08 12:46:16,372 INFO L280 TraceCheckUtils]: 2: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-08 12:46:16,372 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} #41#return; {210#true} is VALID [2020-07-08 12:46:16,372 INFO L263 TraceCheckUtils]: 4: Hoare triple {210#true} call #t~ret2 := main(); {210#true} is VALID [2020-07-08 12:46:16,374 INFO L280 TraceCheckUtils]: 5: Hoare triple {210#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {244#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset))} is VALID [2020-07-08 12:46:16,376 INFO L263 TraceCheckUtils]: 6: Hoare triple {244#(and (= ~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); {248#(and (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset) (= ~tmp~0.base |glob2_#in~pathbuf.base|))} is VALID [2020-07-08 12:46:16,377 INFO L280 TraceCheckUtils]: 7: Hoare triple {248#(and (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset) (= ~tmp~0.base |glob2_#in~pathbuf.base|))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {252#(and (= ~tmp~0.base glob2_~p~0.base) (<= (+ glob2_~p~0.offset 4) ~tmp~0.offset))} is VALID [2020-07-08 12:46:16,378 INFO L280 TraceCheckUtils]: 8: Hoare triple {252#(and (= ~tmp~0.base glob2_~p~0.base) (<= (+ glob2_~p~0.offset 4) ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {252#(and (= ~tmp~0.base glob2_~p~0.base) (<= (+ glob2_~p~0.offset 4) ~tmp~0.offset))} is VALID [2020-07-08 12:46:16,378 INFO L263 TraceCheckUtils]: 9: Hoare triple {252#(and (= ~tmp~0.base glob2_~p~0.base) (<= (+ glob2_~p~0.offset 4) ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {210#true} is VALID [2020-07-08 12:46:16,379 INFO L280 TraceCheckUtils]: 10: Hoare triple {210#true} ~cond := #in~cond; {210#true} is VALID [2020-07-08 12:46:16,379 INFO L280 TraceCheckUtils]: 11: Hoare triple {210#true} assume !(0 == ~cond); {210#true} is VALID [2020-07-08 12:46:16,379 INFO L280 TraceCheckUtils]: 12: Hoare triple {210#true} assume true; {210#true} is VALID [2020-07-08 12:46:16,380 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {210#true} {252#(and (= ~tmp~0.base glob2_~p~0.base) (<= (+ glob2_~p~0.offset 4) ~tmp~0.offset))} #39#return; {252#(and (= ~tmp~0.base glob2_~p~0.base) (<= (+ glob2_~p~0.offset 4) ~tmp~0.offset))} is VALID [2020-07-08 12:46:16,381 INFO L280 TraceCheckUtils]: 14: Hoare triple {252#(and (= ~tmp~0.base glob2_~p~0.base) (<= (+ glob2_~p~0.offset 4) ~tmp~0.offset))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {252#(and (= ~tmp~0.base glob2_~p~0.base) (<= (+ glob2_~p~0.offset 4) ~tmp~0.offset))} is VALID [2020-07-08 12:46:16,383 INFO L280 TraceCheckUtils]: 15: Hoare triple {252#(and (= ~tmp~0.base glob2_~p~0.base) (<= (+ glob2_~p~0.offset 4) ~tmp~0.offset))} #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset;havoc #t~post0.base, #t~post0.offset; {222#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:16,384 INFO L280 TraceCheckUtils]: 16: Hoare triple {222#(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); {222#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:16,385 INFO L263 TraceCheckUtils]: 17: Hoare triple {222#(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)); {283#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:46:16,386 INFO L280 TraceCheckUtils]: 18: Hoare triple {283#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {287#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:46:16,387 INFO L280 TraceCheckUtils]: 19: Hoare triple {287#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {211#false} is VALID [2020-07-08 12:46:16,387 INFO L280 TraceCheckUtils]: 20: Hoare triple {211#false} assume !false; {211#false} is VALID [2020-07-08 12:46:16,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:16,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:46:16,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-07-08 12:46:16,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099425147] [2020-07-08 12:46:16,392 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2020-07-08 12:46:16,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:16,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 12:46:16,436 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-08 12:46:16,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 12:46:16,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:16,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 12:46:16,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-08 12:46:16,438 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 14 states. [2020-07-08 12:46:17,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:17,265 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2020-07-08 12:46:17,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 12:46:17,266 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2020-07-08 12:46:17,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:46:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2020-07-08 12:46:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:46:17,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2020-07-08 12:46:17,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 33 transitions. [2020-07-08 12:46:17,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:17,344 INFO L225 Difference]: With dead ends: 36 [2020-07-08 12:46:17,344 INFO L226 Difference]: Without dead ends: 34 [2020-07-08 12:46:17,345 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2020-07-08 12:46:17,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-08 12:46:17,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-08 12:46:17,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:17,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-08 12:46:17,397 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-08 12:46:17,398 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-08 12:46:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:17,401 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-08 12:46:17,402 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-08 12:46:17,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:17,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:17,405 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-08 12:46:17,405 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-08 12:46:17,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:17,410 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-08 12:46:17,410 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-08 12:46:17,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:17,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:17,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:17,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:17,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 12:46:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2020-07-08 12:46:17,420 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 21 [2020-07-08 12:46:17,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:17,421 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2020-07-08 12:46:17,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 12:46:17,421 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2020-07-08 12:46:17,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 12:46:17,422 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:17,422 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:17,637 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-08 12:46:17,638 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:17,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:17,639 INFO L82 PathProgramCache]: Analyzing trace with hash -2027370867, now seen corresponding path program 2 times [2020-07-08 12:46:17,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:17,640 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711812331] [2020-07-08 12:46:17,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:17,842 INFO L280 TraceCheckUtils]: 0: Hoare triple {491#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp~0.base, ~tmp~0.offset := 0, 0; {472#true} is VALID [2020-07-08 12:46:17,843 INFO L280 TraceCheckUtils]: 1: Hoare triple {472#true} assume true; {472#true} is VALID [2020-07-08 12:46:17,843 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {472#true} {472#true} #41#return; {472#true} is VALID [2020-07-08 12:46:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:17,862 INFO L280 TraceCheckUtils]: 0: Hoare triple {472#true} ~cond := #in~cond; {472#true} is VALID [2020-07-08 12:46:17,863 INFO L280 TraceCheckUtils]: 1: Hoare triple {472#true} assume !(0 == ~cond); {472#true} is VALID [2020-07-08 12:46:17,863 INFO L280 TraceCheckUtils]: 2: Hoare triple {472#true} assume true; {472#true} is VALID [2020-07-08 12:46:17,866 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {472#true} {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #39#return; {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:17,896 INFO L280 TraceCheckUtils]: 0: Hoare triple {472#true} ~cond := #in~cond; {472#true} is VALID [2020-07-08 12:46:17,897 INFO L280 TraceCheckUtils]: 1: Hoare triple {472#true} assume !(0 == ~cond); {472#true} is VALID [2020-07-08 12:46:17,897 INFO L280 TraceCheckUtils]: 2: Hoare triple {472#true} assume true; {472#true} is VALID [2020-07-08 12:46:17,907 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {472#true} {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #39#return; {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:17,909 INFO L263 TraceCheckUtils]: 0: Hoare triple {472#true} call ULTIMATE.init(); {491#(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-08 12:46:17,909 INFO L280 TraceCheckUtils]: 1: Hoare triple {491#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp~0.base, ~tmp~0.offset := 0, 0; {472#true} is VALID [2020-07-08 12:46:17,909 INFO L280 TraceCheckUtils]: 2: Hoare triple {472#true} assume true; {472#true} is VALID [2020-07-08 12:46:17,910 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {472#true} {472#true} #41#return; {472#true} is VALID [2020-07-08 12:46:17,910 INFO L263 TraceCheckUtils]: 4: Hoare triple {472#true} call #t~ret2 := main(); {472#true} is VALID [2020-07-08 12:46:17,912 INFO L280 TraceCheckUtils]: 5: Hoare triple {472#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {477#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= main_~bound~0.offset ~tmp~0.offset))} is VALID [2020-07-08 12:46:17,914 INFO L263 TraceCheckUtils]: 6: Hoare triple {477#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= main_~bound~0.offset ~tmp~0.offset))} call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {478#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} is VALID [2020-07-08 12:46:17,915 INFO L280 TraceCheckUtils]: 7: Hoare triple {478#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:17,916 INFO L280 TraceCheckUtils]: 8: Hoare triple {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:17,917 INFO L263 TraceCheckUtils]: 9: Hoare triple {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {472#true} is VALID [2020-07-08 12:46:17,917 INFO L280 TraceCheckUtils]: 10: Hoare triple {472#true} ~cond := #in~cond; {472#true} is VALID [2020-07-08 12:46:17,918 INFO L280 TraceCheckUtils]: 11: Hoare triple {472#true} assume !(0 == ~cond); {472#true} is VALID [2020-07-08 12:46:17,918 INFO L280 TraceCheckUtils]: 12: Hoare triple {472#true} assume true; {472#true} is VALID [2020-07-08 12:46:17,929 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {472#true} {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #39#return; {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:17,930 INFO L280 TraceCheckUtils]: 14: Hoare triple {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:17,931 INFO L280 TraceCheckUtils]: 15: Hoare triple {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset;havoc #t~post0.base, #t~post0.offset; {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:17,932 INFO L280 TraceCheckUtils]: 16: Hoare triple {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:17,932 INFO L263 TraceCheckUtils]: 17: Hoare triple {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {472#true} is VALID [2020-07-08 12:46:17,933 INFO L280 TraceCheckUtils]: 18: Hoare triple {472#true} ~cond := #in~cond; {472#true} is VALID [2020-07-08 12:46:17,933 INFO L280 TraceCheckUtils]: 19: Hoare triple {472#true} assume !(0 == ~cond); {472#true} is VALID [2020-07-08 12:46:17,933 INFO L280 TraceCheckUtils]: 20: Hoare triple {472#true} assume true; {472#true} is VALID [2020-07-08 12:46:17,935 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {472#true} {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #39#return; {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:17,936 INFO L280 TraceCheckUtils]: 22: Hoare triple {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:17,937 INFO L280 TraceCheckUtils]: 23: Hoare triple {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset;havoc #t~post0.base, #t~post0.offset; {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:17,939 INFO L280 TraceCheckUtils]: 24: Hoare triple {479#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {488#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:17,940 INFO L263 TraceCheckUtils]: 25: Hoare triple {488#(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)); {489#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:46:17,941 INFO L280 TraceCheckUtils]: 26: Hoare triple {489#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {490#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:46:17,943 INFO L280 TraceCheckUtils]: 27: Hoare triple {490#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {473#false} is VALID [2020-07-08 12:46:17,943 INFO L280 TraceCheckUtils]: 28: Hoare triple {473#false} assume !false; {473#false} is VALID [2020-07-08 12:46:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-08 12:46:17,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711812331] [2020-07-08 12:46:17,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295483772] [2020-07-08 12:46:17,946 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:17,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-08 12:46:17,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:46:18,000 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-08 12:46:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:18,013 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:18,146 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:18,200 INFO L263 TraceCheckUtils]: 0: Hoare triple {472#true} call ULTIMATE.init(); {472#true} is VALID [2020-07-08 12:46:18,200 INFO L280 TraceCheckUtils]: 1: Hoare triple {472#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~tmp~0.base, ~tmp~0.offset := 0, 0; {472#true} is VALID [2020-07-08 12:46:18,201 INFO L280 TraceCheckUtils]: 2: Hoare triple {472#true} assume true; {472#true} is VALID [2020-07-08 12:46:18,201 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {472#true} {472#true} #41#return; {472#true} is VALID [2020-07-08 12:46:18,201 INFO L263 TraceCheckUtils]: 4: Hoare triple {472#true} call #t~ret2 := main(); {472#true} is VALID [2020-07-08 12:46:18,203 INFO L280 TraceCheckUtils]: 5: Hoare triple {472#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.allocOnStack(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, 8 + ~#pathbuf~0.offset - 4; {510#(and (= ~tmp~0.base main_~bound~0.base) (<= main_~bound~0.offset ~tmp~0.offset))} is VALID [2020-07-08 12:46:18,204 INFO L263 TraceCheckUtils]: 6: Hoare triple {510#(and (= ~tmp~0.base main_~bound~0.base) (<= main_~bound~0.offset ~tmp~0.offset))} call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {514#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} is VALID [2020-07-08 12:46:18,206 INFO L280 TraceCheckUtils]: 7: Hoare triple {514#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {518#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2020-07-08 12:46:18,207 INFO L280 TraceCheckUtils]: 8: Hoare triple {518#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {518#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2020-07-08 12:46:18,207 INFO L263 TraceCheckUtils]: 9: Hoare triple {518#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {472#true} is VALID [2020-07-08 12:46:18,207 INFO L280 TraceCheckUtils]: 10: Hoare triple {472#true} ~cond := #in~cond; {472#true} is VALID [2020-07-08 12:46:18,208 INFO L280 TraceCheckUtils]: 11: Hoare triple {472#true} assume !(0 == ~cond); {472#true} is VALID [2020-07-08 12:46:18,208 INFO L280 TraceCheckUtils]: 12: Hoare triple {472#true} assume true; {472#true} is VALID [2020-07-08 12:46:18,209 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {472#true} {518#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} #39#return; {518#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2020-07-08 12:46:18,209 INFO L280 TraceCheckUtils]: 14: Hoare triple {518#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {518#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2020-07-08 12:46:18,210 INFO L280 TraceCheckUtils]: 15: Hoare triple {518#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset;havoc #t~post0.base, #t~post0.offset; {518#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2020-07-08 12:46:18,213 INFO L280 TraceCheckUtils]: 16: Hoare triple {518#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {518#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2020-07-08 12:46:18,214 INFO L263 TraceCheckUtils]: 17: Hoare triple {518#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {472#true} is VALID [2020-07-08 12:46:18,214 INFO L280 TraceCheckUtils]: 18: Hoare triple {472#true} ~cond := #in~cond; {472#true} is VALID [2020-07-08 12:46:18,214 INFO L280 TraceCheckUtils]: 19: Hoare triple {472#true} assume !(0 == ~cond); {472#true} is VALID [2020-07-08 12:46:18,214 INFO L280 TraceCheckUtils]: 20: Hoare triple {472#true} assume true; {472#true} is VALID [2020-07-08 12:46:18,217 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {472#true} {518#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} #39#return; {518#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2020-07-08 12:46:18,221 INFO L280 TraceCheckUtils]: 22: Hoare triple {518#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {518#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2020-07-08 12:46:18,223 INFO L280 TraceCheckUtils]: 23: Hoare triple {518#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} #t~post0.base, #t~post0.offset := ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := #t~post0.base, 4 + #t~post0.offset;havoc #t~post0.base, #t~post0.offset; {518#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2020-07-08 12:46:18,224 INFO L280 TraceCheckUtils]: 24: Hoare triple {518#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {488#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2020-07-08 12:46:18,225 INFO L263 TraceCheckUtils]: 25: Hoare triple {488#(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)); {573#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:46:18,226 INFO L280 TraceCheckUtils]: 26: Hoare triple {573#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {577#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:46:18,227 INFO L280 TraceCheckUtils]: 27: Hoare triple {577#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {473#false} is VALID [2020-07-08 12:46:18,227 INFO L280 TraceCheckUtils]: 28: Hoare triple {473#false} assume !false; {473#false} is VALID [2020-07-08 12:46:18,229 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-08 12:46:18,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:46:18,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-07-08 12:46:18,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19515736] [2020-07-08 12:46:18,230 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2020-07-08 12:46:18,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:18,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 12:46:18,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:18,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 12:46:18,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:18,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 12:46:18,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2020-07-08 12:46:18,275 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 14 states. [2020-07-08 12:46:18,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:18,968 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2020-07-08 12:46:18,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:46:18,969 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2020-07-08 12:46:18,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:46:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 18 transitions. [2020-07-08 12:46:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:46:18,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 18 transitions. [2020-07-08 12:46:18,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 18 transitions. [2020-07-08 12:46:19,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:19,005 INFO L225 Difference]: With dead ends: 32 [2020-07-08 12:46:19,005 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:46:19,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2020-07-08 12:46:19,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:46:19,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:46:19,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:19,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:19,008 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:19,009 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:19,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:19,009 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:46:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:46:19,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:19,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:19,010 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:19,010 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:19,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:19,010 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:46:19,010 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:46:19,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:19,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:19,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:19,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:46:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:46:19,011 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2020-07-08 12:46:19,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:19,012 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:46:19,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 12:46:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:46:19,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:19,222 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:19,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:46:19,508 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:46:19,508 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-08 12:46:19,508 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:46:19,508 INFO L271 CegarLoopResult]: At program point glob2ENTRY(lines 14 25) the Hoare annotation is: true [2020-07-08 12:46:19,509 INFO L268 CegarLoopResult]: For program point glob2EXIT(lines 14 25) no Hoare annotation was computed. [2020-07-08 12:46:19,509 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (not (<= 4 ~tmp~0.offset)) (not (= ~tmp~0.base |glob2_#in~pathlim.base|)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (and (<= glob2_~p~0.offset ~tmp~0.offset) (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base)) (not (= 0 |glob2_#in~pathbuf.offset|)) (not (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))) [2020-07-08 12:46:19,509 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-08 12:46:19,509 INFO L268 CegarLoopResult]: For program point L18-2(lines 18 22) no Hoare annotation was computed. [2020-07-08 12:46:19,509 INFO L264 CegarLoopResult]: At program point L18-3(lines 18 22) the Hoare annotation is: (or (not (<= 4 ~tmp~0.offset)) (not (= ~tmp~0.base |glob2_#in~pathlim.base|)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (not (= 0 |glob2_#in~pathbuf.offset|)) (not (<= |glob2_#in~pathlim.offset| ~tmp~0.offset)) (and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))) [2020-07-08 12:46:19,510 INFO L268 CegarLoopResult]: For program point L18-4(lines 18 22) no Hoare annotation was computed. [2020-07-08 12:46:19,510 INFO L268 CegarLoopResult]: For program point glob2FINAL(lines 14 25) no Hoare annotation was computed. [2020-07-08 12:46:19,510 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:46:19,510 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:46:19,510 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:46:19,510 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:46:19,510 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-08 12:46:19,511 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 27 38) no Hoare annotation was computed. [2020-07-08 12:46:19,511 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 27 38) no Hoare annotation was computed. [2020-07-08 12:46:19,511 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (= 0 |main_~#pathbuf~0.offset|) (= ~tmp~0.base main_~bound~0.base) (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= main_~bound~0.offset ~tmp~0.offset) (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset)) [2020-07-08 12:46:19,511 INFO L268 CegarLoopResult]: For program point L35-1(line 35) no Hoare annotation was computed. [2020-07-08 12:46:19,511 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-07-08 12:46:19,511 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2020-07-08 12:46:19,511 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-08 12:46:19,512 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-08 12:46:19,512 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-08 12:46:19,512 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2020-07-08 12:46:19,516 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:46:19,519 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:46:19,519 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:46:19,519 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-08 12:46:19,519 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-08 12:46:19,520 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:46:19,521 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-08 12:46:19,521 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:46:19,521 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:46:19,522 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:46:19,522 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2020-07-08 12:46:19,522 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-08 12:46:19,522 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:46:19,522 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-08 12:46:19,522 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:46:19,522 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:46:19,522 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-08 12:46:19,522 WARN L170 areAnnotationChecker]: glob2FINAL has no Hoare annotation [2020-07-08 12:46:19,523 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-08 12:46:19,523 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:46:19,523 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:19,523 WARN L170 areAnnotationChecker]: glob2EXIT has no Hoare annotation [2020-07-08 12:46:19,523 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-08 12:46:19,523 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:46:19,523 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:46:19,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:46:19 BoogieIcfgContainer [2020-07-08 12:46:19,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:46:19,546 INFO L168 Benchmark]: Toolchain (without parser) took 6779.57 ms. Allocated memory was 137.9 MB in the beginning and 285.7 MB in the end (delta: 147.8 MB). Free memory was 102.1 MB in the beginning and 201.6 MB in the end (delta: -99.5 MB). Peak memory consumption was 48.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:19,547 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:46:19,547 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.72 ms. Allocated memory is still 137.9 MB. Free memory was 102.1 MB in the beginning and 91.7 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:19,549 INFO L168 Benchmark]: Boogie Preprocessor took 136.19 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 91.7 MB in the beginning and 180.0 MB in the end (delta: -88.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:19,549 INFO L168 Benchmark]: RCFGBuilder took 417.25 ms. Allocated memory is still 202.4 MB. Free memory was 180.0 MB in the beginning and 160.0 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:19,550 INFO L168 Benchmark]: TraceAbstraction took 5888.74 ms. Allocated memory was 202.4 MB in the beginning and 285.7 MB in the end (delta: 83.4 MB). Free memory was 159.0 MB in the beginning and 201.6 MB in the end (delta: -42.6 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:19,554 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.23 ms. Allocated memory is still 137.9 MB. Free memory is still 120.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 330.72 ms. Allocated memory is still 137.9 MB. Free memory was 102.1 MB in the beginning and 91.7 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 136.19 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 91.7 MB in the beginning and 180.0 MB in the end (delta: -88.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 417.25 ms. Allocated memory is still 202.4 MB. Free memory was 180.0 MB in the beginning and 160.0 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5888.74 ms. Allocated memory was 202.4 MB in the beginning and 285.7 MB in the end (delta: 83.4 MB). Free memory was 159.0 MB in the beginning and 201.6 MB in the end (delta: -42.6 MB). Peak memory consumption was 40.8 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) || !(tmp == pathlim)) || !(tmp == pathbuf)) || !(0 == pathbuf)) || !(pathlim <= tmp)) || ((pathlim == tmp && pathlim <= tmp) && tmp == p) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.5s, OverallIterations: 3, TraceHistogramMax: 3, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 30 SDtfs, 97 SDslu, 131 SDs, 0 SdLazy, 317 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 12 PreInvPairs, 17 NumberOfFragments, 113 HoareAnnotationTreeSize, 12 FomulaSimplifications, 134 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 172 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 113 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 11012 SizeOfPredicates, 16 NumberOfNonLiveVariables, 213 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 32/40 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...