java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:30:06,888 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:30:06,891 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:30:06,908 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:30:06,908 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:30:06,909 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:30:06,910 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:30:06,912 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:30:06,914 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:30:06,915 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:30:06,916 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:30:06,916 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:30:06,917 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:30:06,918 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:30:06,919 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:30:06,920 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:30:06,921 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:30:06,923 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:30:06,925 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:30:06,927 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:30:06,928 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:30:06,929 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:30:06,932 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:30:06,932 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:30:06,932 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:30:06,933 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:30:06,934 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:30:06,935 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:30:06,938 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:30:06,941 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:30:06,941 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:30:06,942 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:30:06,942 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:30:06,943 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:30:06,946 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:30:06,947 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:30:06,947 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:30:06,969 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:30:06,970 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:30:06,971 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:30:06,971 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:30:06,971 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:30:06,972 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:30:06,972 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:30:06,972 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:30:06,972 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:30:06,972 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:30:06,973 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:30:06,973 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:30:06,973 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:30:06,973 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:30:06,973 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:30:06,974 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:30:06,974 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:30:06,974 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:30:06,974 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:30:06,974 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:30:06,975 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:30:06,975 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:30:06,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:30:06,975 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:30:06,975 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:30:06,976 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:30:06,976 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:30:06,976 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:30:06,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:30:06,976 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:30:07,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:30:07,052 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:30:07,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:30:07,057 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:30:07,058 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:30:07,059 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i [2018-11-14 17:30:07,129 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a0889ea/82e278ee91334d3087e781f108085f0b/FLAG71e3a082f [2018-11-14 17:30:07,669 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:30:07,670 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i [2018-11-14 17:30:07,676 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a0889ea/82e278ee91334d3087e781f108085f0b/FLAG71e3a082f [2018-11-14 17:30:07,690 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a0889ea/82e278ee91334d3087e781f108085f0b [2018-11-14 17:30:07,700 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:30:07,701 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:30:07,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:30:07,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:30:07,706 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:30:07,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:30:07" (1/1) ... [2018-11-14 17:30:07,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d6bab41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:07, skipping insertion in model container [2018-11-14 17:30:07,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:30:07" (1/1) ... [2018-11-14 17:30:07,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:30:07,757 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:30:08,012 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:30:08,025 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:30:08,048 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:30:08,075 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:30:08,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:08 WrapperNode [2018-11-14 17:30:08,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:30:08,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:30:08,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:30:08,077 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:30:08,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:08" (1/1) ... [2018-11-14 17:30:08,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:08" (1/1) ... [2018-11-14 17:30:08,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:08" (1/1) ... [2018-11-14 17:30:08,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:08" (1/1) ... [2018-11-14 17:30:08,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:08" (1/1) ... [2018-11-14 17:30:08,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:08" (1/1) ... [2018-11-14 17:30:08,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:08" (1/1) ... [2018-11-14 17:30:08,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:30:08,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:30:08,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:30:08,134 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:30:08,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:08" (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 [2018-11-14 17:30:08,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:30:08,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:30:08,283 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:30:08,283 INFO L138 BoogieDeclarations]: Found implementation of procedure glob2 [2018-11-14 17:30:08,283 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:30:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:30:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:30:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure glob2 [2018-11-14 17:30:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:30:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:30:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:30:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:30:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:30:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:30:08,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:30:08,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:30:08,814 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:30:08,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:30:08 BoogieIcfgContainer [2018-11-14 17:30:08,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:30:08,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:30:08,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:30:08,819 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:30:08,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:30:07" (1/3) ... [2018-11-14 17:30:08,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672faf17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:30:08, skipping insertion in model container [2018-11-14 17:30:08,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:08" (2/3) ... [2018-11-14 17:30:08,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672faf17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:30:08, skipping insertion in model container [2018-11-14 17:30:08,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:30:08" (3/3) ... [2018-11-14 17:30:08,824 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_NetBSD-libc__loop_false-unreach-call_true-termination.i [2018-11-14 17:30:08,834 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:30:08,842 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:30:08,859 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:30:08,901 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:30:08,902 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:30:08,902 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:30:08,902 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:30:08,902 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:30:08,903 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:30:08,903 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:30:08,903 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:30:08,903 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:30:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-14 17:30:08,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 17:30:08,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:30:08,927 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:30:08,930 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:30:08,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:30:08,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1583108737, now seen corresponding path program 1 times [2018-11-14 17:30:08,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:30:08,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:30:08,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:08,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:30:08,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:30:09,755 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-14 17:30:09,760 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~tmp~0.base, ~tmp~0.offset := 0, 0; {30#true} is VALID [2018-11-14 17:30:09,760 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-14 17:30:09,761 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #42#return; {30#true} is VALID [2018-11-14 17:30:09,761 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret2 := main(); {30#true} is VALID [2018-11-14 17:30:09,763 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.alloc(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, ~#pathbuf~0.offset + 32 - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, ~#pathbuf~0.offset + 8 - 4; {32#(and (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset) (= ~tmp~0.base |main_~#pathbuf~0.base|) (= |main_~#pathbuf~0.offset| 0))} is VALID [2018-11-14 17:30:09,766 INFO L256 TraceCheckUtils]: 6: Hoare triple {32#(and (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset) (= ~tmp~0.base |main_~#pathbuf~0.base|) (= |main_~#pathbuf~0.offset| 0))} call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {33#(and (= 0 |glob2_#in~pathbuf.offset|) (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= 4 ~tmp~0.offset))} is VALID [2018-11-14 17:30:09,769 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#(and (= 0 |glob2_#in~pathbuf.offset|) (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= 4 ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {34#(and (= glob2_~p~0.offset 0) (<= 4 ~tmp~0.offset) (= glob2_~p~0.base ~tmp~0.base))} is VALID [2018-11-14 17:30:09,771 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#(and (= glob2_~p~0.offset 0) (<= 4 ~tmp~0.offset) (= glob2_~p~0.base ~tmp~0.base))} assume true; {34#(and (= glob2_~p~0.offset 0) (<= 4 ~tmp~0.offset) (= glob2_~p~0.base ~tmp~0.base))} is VALID [2018-11-14 17:30:09,772 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#(and (= glob2_~p~0.offset 0) (<= 4 ~tmp~0.offset) (= glob2_~p~0.base ~tmp~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {34#(and (= glob2_~p~0.offset 0) (<= 4 ~tmp~0.offset) (= glob2_~p~0.base ~tmp~0.base))} is VALID [2018-11-14 17:30:09,775 INFO L256 TraceCheckUtils]: 10: Hoare triple {34#(and (= glob2_~p~0.offset 0) (<= 4 ~tmp~0.offset) (= glob2_~p~0.base ~tmp~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {35#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:30:09,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {36#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:30:09,783 INFO L273 TraceCheckUtils]: 12: Hoare triple {36#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {31#false} is VALID [2018-11-14 17:30:09,784 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-14 17:30:09,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:30:09,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:30:09,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 17:30:09,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-14 17:30:09,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:30:09,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:30:09,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:30:09,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:30:09,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:30:09,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:30:09,859 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 7 states. [2018-11-14 17:30:11,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:11,037 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-11-14 17:30:11,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:30:11,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-11-14 17:30:11,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:30:11,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:30:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2018-11-14 17:30:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:30:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2018-11-14 17:30:11,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2018-11-14 17:30:11,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:30:11,250 INFO L225 Difference]: With dead ends: 58 [2018-11-14 17:30:11,250 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 17:30:11,254 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:30:11,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 17:30:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-14 17:30:11,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:30:11,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2018-11-14 17:30:11,327 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2018-11-14 17:30:11,328 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2018-11-14 17:30:11,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:11,333 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-14 17:30:11,333 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-14 17:30:11,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:30:11,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:30:11,334 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2018-11-14 17:30:11,335 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2018-11-14 17:30:11,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:11,338 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-14 17:30:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-14 17:30:11,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:30:11,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:30:11,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:30:11,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:30:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:30:11,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-14 17:30:11,345 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 14 [2018-11-14 17:30:11,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:30:11,345 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-14 17:30:11,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:30:11,346 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-14 17:30:11,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 17:30:11,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:30:11,347 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:30:11,347 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:30:11,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:30:11,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1693639993, now seen corresponding path program 1 times [2018-11-14 17:30:11,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:30:11,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:30:11,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:11,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:30:11,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:30:11,829 INFO L256 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2018-11-14 17:30:11,829 INFO L273 TraceCheckUtils]: 1: Hoare triple {210#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~tmp~0.base, ~tmp~0.offset := 0, 0; {210#true} is VALID [2018-11-14 17:30:11,830 INFO L273 TraceCheckUtils]: 2: Hoare triple {210#true} assume true; {210#true} is VALID [2018-11-14 17:30:11,830 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} #42#return; {210#true} is VALID [2018-11-14 17:30:11,830 INFO L256 TraceCheckUtils]: 4: Hoare triple {210#true} call #t~ret2 := main(); {210#true} is VALID [2018-11-14 17:30:11,831 INFO L273 TraceCheckUtils]: 5: Hoare triple {210#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.alloc(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, ~#pathbuf~0.offset + 32 - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, ~#pathbuf~0.offset + 8 - 4; {212#(and (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset) (= ~tmp~0.base |main_~#pathbuf~0.base|) (= |main_~#pathbuf~0.offset| 0))} is VALID [2018-11-14 17:30:11,835 INFO L256 TraceCheckUtils]: 6: Hoare triple {212#(and (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset) (= ~tmp~0.base |main_~#pathbuf~0.base|) (= |main_~#pathbuf~0.offset| 0))} call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {213#(and (= 0 |glob2_#in~pathbuf.offset|) (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= 4 ~tmp~0.offset))} is VALID [2018-11-14 17:30:11,836 INFO L273 TraceCheckUtils]: 7: Hoare triple {213#(and (= 0 |glob2_#in~pathbuf.offset|) (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= 4 ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {214#(and (= glob2_~p~0.offset 0) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-14 17:30:11,842 INFO L273 TraceCheckUtils]: 8: Hoare triple {214#(and (= glob2_~p~0.offset 0) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume true; {214#(and (= glob2_~p~0.offset 0) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-14 17:30:11,842 INFO L273 TraceCheckUtils]: 9: Hoare triple {214#(and (= glob2_~p~0.offset 0) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {214#(and (= glob2_~p~0.offset 0) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-14 17:30:11,843 INFO L256 TraceCheckUtils]: 10: Hoare triple {214#(and (= glob2_~p~0.offset 0) (<= 4 ~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)); {210#true} is VALID [2018-11-14 17:30:11,843 INFO L273 TraceCheckUtils]: 11: Hoare triple {210#true} ~cond := #in~cond; {215#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 17:30:11,866 INFO L273 TraceCheckUtils]: 12: Hoare triple {215#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(~cond == 0); {216#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:30:11,876 INFO L273 TraceCheckUtils]: 13: Hoare triple {216#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {216#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:30:11,877 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {216#(not (= |__VERIFIER_assert_#in~cond| 0))} {214#(and (= glob2_~p~0.offset 0) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #40#return; {214#(and (= glob2_~p~0.offset 0) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-14 17:30:11,878 INFO L273 TraceCheckUtils]: 15: Hoare triple {214#(and (= glob2_~p~0.offset 0) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {214#(and (= glob2_~p~0.offset 0) (<= 4 ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-14 17:30:11,878 INFO L273 TraceCheckUtils]: 16: Hoare triple {214#(and (= glob2_~p~0.offset 0) (<= 4 ~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, #t~post0.offset + 4;havoc #t~post0.base, #t~post0.offset; {217#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= glob2_~p~0.base ~tmp~0.base))} is VALID [2018-11-14 17:30:11,880 INFO L273 TraceCheckUtils]: 17: Hoare triple {217#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= glob2_~p~0.base ~tmp~0.base))} assume true; {217#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= glob2_~p~0.base ~tmp~0.base))} is VALID [2018-11-14 17:30:11,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {217#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= glob2_~p~0.base ~tmp~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {217#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= glob2_~p~0.base ~tmp~0.base))} is VALID [2018-11-14 17:30:11,882 INFO L256 TraceCheckUtils]: 19: Hoare triple {217#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= glob2_~p~0.base ~tmp~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {216#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:30:11,883 INFO L273 TraceCheckUtils]: 20: Hoare triple {216#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {218#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 17:30:11,884 INFO L273 TraceCheckUtils]: 21: Hoare triple {218#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {211#false} is VALID [2018-11-14 17:30:11,884 INFO L273 TraceCheckUtils]: 22: Hoare triple {211#false} assume !false; {211#false} is VALID [2018-11-14 17:30:11,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:30:11,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:30:11,888 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:30:11,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:30:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:30:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:30:11,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:30:12,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {210#true} call ULTIMATE.init(); {210#true} is VALID [2018-11-14 17:30:12,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {210#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~tmp~0.base, ~tmp~0.offset := 0, 0; {210#true} is VALID [2018-11-14 17:30:12,552 INFO L273 TraceCheckUtils]: 2: Hoare triple {210#true} assume true; {210#true} is VALID [2018-11-14 17:30:12,552 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} #42#return; {210#true} is VALID [2018-11-14 17:30:12,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {210#true} call #t~ret2 := main(); {210#true} is VALID [2018-11-14 17:30:12,554 INFO L273 TraceCheckUtils]: 5: Hoare triple {210#true} call ~#pathbuf~0.base, ~#pathbuf~0.offset := #Ultimate.alloc(8);~bound~0.base, ~bound~0.offset := ~#pathbuf~0.base, ~#pathbuf~0.offset + 32 - 4;~tmp~0.base, ~tmp~0.offset := ~#pathbuf~0.base, ~#pathbuf~0.offset + 8 - 4; {237#(and (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset) (= ~tmp~0.base |main_~#pathbuf~0.base|))} is VALID [2018-11-14 17:30:12,555 INFO L256 TraceCheckUtils]: 6: Hoare triple {237#(and (<= (+ |main_~#pathbuf~0.offset| 4) ~tmp~0.offset) (= ~tmp~0.base |main_~#pathbuf~0.base|))} call #t~ret1 := glob2(~#pathbuf~0.base, ~#pathbuf~0.offset, ~bound~0.base, ~bound~0.offset); {241#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2018-11-14 17:30:12,557 INFO L273 TraceCheckUtils]: 7: Hoare triple {241#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} ~pathbuf.base, ~pathbuf.offset := #in~pathbuf.base, #in~pathbuf.offset;~pathlim.base, ~pathlim.offset := #in~pathlim.base, #in~pathlim.offset;havoc ~p~0.base, ~p~0.offset;~p~0.base, ~p~0.offset := ~pathbuf.base, ~pathbuf.offset; {245#(and (<= (+ glob2_~p~0.offset 4) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-14 17:30:12,558 INFO L273 TraceCheckUtils]: 8: Hoare triple {245#(and (<= (+ glob2_~p~0.offset 4) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume true; {245#(and (<= (+ glob2_~p~0.offset 4) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-14 17:30:12,559 INFO L273 TraceCheckUtils]: 9: Hoare triple {245#(and (<= (+ glob2_~p~0.offset 4) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {245#(and (<= (+ glob2_~p~0.offset 4) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-14 17:30:12,559 INFO L256 TraceCheckUtils]: 10: Hoare triple {245#(and (<= (+ glob2_~p~0.offset 4) ~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)); {210#true} is VALID [2018-11-14 17:30:12,560 INFO L273 TraceCheckUtils]: 11: Hoare triple {210#true} ~cond := #in~cond; {215#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-14 17:30:12,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {215#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(~cond == 0); {216#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:30:12,584 INFO L273 TraceCheckUtils]: 13: Hoare triple {216#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {216#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:30:12,593 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {216#(not (= |__VERIFIER_assert_#in~cond| 0))} {245#(and (<= (+ glob2_~p~0.offset 4) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} #40#return; {245#(and (<= (+ glob2_~p~0.offset 4) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-14 17:30:12,607 INFO L273 TraceCheckUtils]: 15: Hoare triple {245#(and (<= (+ glob2_~p~0.offset 4) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} call write~int(1, ~p~0.base, ~p~0.offset, 4); {245#(and (<= (+ glob2_~p~0.offset 4) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2018-11-14 17:30:12,616 INFO L273 TraceCheckUtils]: 16: Hoare triple {245#(and (<= (+ glob2_~p~0.offset 4) ~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, #t~post0.offset + 4;havoc #t~post0.base, #t~post0.offset; {217#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= glob2_~p~0.base ~tmp~0.base))} is VALID [2018-11-14 17:30:12,629 INFO L273 TraceCheckUtils]: 17: Hoare triple {217#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= glob2_~p~0.base ~tmp~0.base))} assume true; {217#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= glob2_~p~0.base ~tmp~0.base))} is VALID [2018-11-14 17:30:12,631 INFO L273 TraceCheckUtils]: 18: Hoare triple {217#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= glob2_~p~0.base ~tmp~0.base))} assume !!(~p~0.base == ~pathlim.base && ~p~0.offset <= ~pathlim.offset); {217#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= glob2_~p~0.base ~tmp~0.base))} is VALID [2018-11-14 17:30:12,632 INFO L256 TraceCheckUtils]: 19: Hoare triple {217#(and (<= glob2_~p~0.offset ~tmp~0.offset) (= glob2_~p~0.base ~tmp~0.base))} call __VERIFIER_assert((if ~p~0.base == ~tmp~0.base && ~p~0.offset <= ~tmp~0.offset then 1 else 0)); {282#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:30:12,633 INFO L273 TraceCheckUtils]: 20: Hoare triple {282#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {286#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:30:12,634 INFO L273 TraceCheckUtils]: 21: Hoare triple {286#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {211#false} is VALID [2018-11-14 17:30:12,634 INFO L273 TraceCheckUtils]: 22: Hoare triple {211#false} assume !false; {211#false} is VALID [2018-11-14 17:30:12,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:30:12,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:30:12,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2018-11-14 17:30:12,668 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-11-14 17:30:12,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:30:12,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 17:30:12,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:30:12,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 17:30:12,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 17:30:12,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:30:12,745 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2018-11-14 17:30:13,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:13,489 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-14 17:30:13,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:30:13,489 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-11-14 17:30:13,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:30:13,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:30:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2018-11-14 17:30:13,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:30:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2018-11-14 17:30:13,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 34 transitions. [2018-11-14 17:30:13,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:30:13,550 INFO L225 Difference]: With dead ends: 37 [2018-11-14 17:30:13,551 INFO L226 Difference]: Without dead ends: 35 [2018-11-14 17:30:13,552 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:30:13,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-14 17:30:13,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-14 17:30:13,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:30:13,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-14 17:30:13,609 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 17:30:13,610 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 17:30:13,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:13,613 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-14 17:30:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-14 17:30:13,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:30:13,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:30:13,614 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 17:30:13,615 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 17:30:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:13,618 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-14 17:30:13,618 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-14 17:30:13,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:30:13,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:30:13,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:30:13,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:30:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:30:13,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-14 17:30:13,622 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 23 [2018-11-14 17:30:13,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:30:13,623 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-14 17:30:13,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 17:30:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-14 17:30:13,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:30:13,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:30:13,625 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:30:13,625 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:30:13,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:30:13,625 INFO L82 PathProgramCache]: Analyzing trace with hash 563486335, now seen corresponding path program 2 times [2018-11-14 17:30:13,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:30:13,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:30:13,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:13,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:30:13,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:30:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:30:13,715 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 17:30:13,770 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-14 17:30:13,770 WARN L170 areAnnotationChecker]: glob2ENTRY has no Hoare annotation [2018-11-14 17:30:13,771 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:30:13,771 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:30:13,771 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 17:30:13,771 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-14 17:30:13,771 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:30:13,771 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2018-11-14 17:30:13,771 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2018-11-14 17:30:13,772 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:30:13,772 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:30:13,772 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-14 17:30:13,772 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-14 17:30:13,772 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:30:13,772 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:30:13,772 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:30:13,772 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-14 17:30:13,773 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-14 17:30:13,773 WARN L170 areAnnotationChecker]: L18-5 has no Hoare annotation [2018-11-14 17:30:13,773 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:30:13,773 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2018-11-14 17:30:13,773 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 17:30:13,773 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 17:30:13,773 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-14 17:30:13,774 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-14 17:30:13,774 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-14 17:30:13,774 WARN L170 areAnnotationChecker]: glob2FINAL has no Hoare annotation [2018-11-14 17:30:13,774 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:30:13,774 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 17:30:13,774 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2018-11-14 17:30:13,774 WARN L170 areAnnotationChecker]: glob2EXIT has no Hoare annotation [2018-11-14 17:30:13,775 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:30:13,775 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2018-11-14 17:30:13,775 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:30:13,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:30:13 BoogieIcfgContainer [2018-11-14 17:30:13,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:30:13,781 INFO L168 Benchmark]: Toolchain (without parser) took 6080.31 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -440.9 MB). Peak memory consumption was 292.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:30:13,782 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:30:13,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:30:13,784 INFO L168 Benchmark]: Boogie Preprocessor took 55.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:30:13,785 INFO L168 Benchmark]: RCFGBuilder took 681.39 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:30:13,786 INFO L168 Benchmark]: TraceAbstraction took 4963.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 321.5 MB). Peak memory consumption was 321.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:30:13,790 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 374.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 681.39 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4963.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 321.5 MB). Peak memory consumption was 321.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] Char *tmp; VAL [\old(tmp)=11, \old(tmp)=13, tmp={0:0}] [L29] FCALL Char pathbuf[1 +1]; [L31] Char *bound = pathbuf + sizeof(pathbuf) - 1; [L33] tmp = pathbuf + sizeof(pathbuf)/sizeof(*pathbuf) - 1 VAL [\old(tmp)=0, \old(tmp)=0, bound={10:28}, pathbuf={10:0}, tmp={10:4}] [L35] CALL glob2 (pathbuf, bound) VAL [\old(tmp)=0, \old(tmp)=0, pathbuf={10:0}, pathlim={10:28}, tmp={10:4}] [L16] Char *p; [L18] p = pathbuf VAL [\old(tmp)=0, \old(tmp)=0, p={10:0}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L18] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={10:0}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L20] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, tmp={10:4}] [L4] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, cond=1, tmp={10:4}] [L20] __VERIFIER_assert(p<=tmp) VAL [\old(tmp)=0, \old(tmp)=0, p={10:0}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L21] FCALL *p = 1 VAL [\old(tmp)=0, \old(tmp)=0, p={10:0}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L18] p++ VAL [\old(tmp)=0, \old(tmp)=0, p={10:4}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L18] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={10:4}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L20] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, tmp={10:4}] [L4] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, \old(tmp)=0, \old(tmp)=0, cond=1, tmp={10:4}] [L20] __VERIFIER_assert(p<=tmp) VAL [\old(tmp)=0, \old(tmp)=0, p={10:4}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L21] FCALL *p = 1 VAL [\old(tmp)=0, \old(tmp)=0, p={10:4}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L18] p++ VAL [\old(tmp)=0, \old(tmp)=0, p={10:8}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L18] COND TRUE p <= pathlim VAL [\old(tmp)=0, \old(tmp)=0, p={10:8}, pathbuf={10:0}, pathbuf={10:0}, pathlim={10:28}, pathlim={10:28}, tmp={10:4}] [L20] CALL __VERIFIER_assert(p<=tmp) VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, tmp={10:4}] [L4] COND TRUE !(cond) VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, cond=0, tmp={10:4}] [L5] __VERIFIER_error() VAL [\old(cond)=0, \old(tmp)=0, \old(tmp)=0, cond=0, tmp={10:4}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 27 locations, 1 error locations. UNSAFE Result, 4.8s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 29 SDtfs, 58 SDslu, 134 SDs, 0 SdLazy, 156 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 5826 SizeOfPredicates, 8 NumberOfNonLiveVariables, 115 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 2/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...