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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_sentinel_true-unreach-call.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:09:44,185 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:09:44,187 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:09:44,205 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:09:44,205 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:09:44,208 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:09:44,210 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:09:44,213 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:09:44,214 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:09:44,218 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:09:44,221 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:09:44,221 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:09:44,222 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:09:44,223 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:09:44,227 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:09:44,227 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:09:44,228 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:09:44,239 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:09:44,243 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:09:44,245 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:09:44,246 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:09:44,248 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:09:44,252 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:09:44,253 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:09:44,253 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:09:44,255 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:09:44,257 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:09:44,258 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:09:44,259 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:09:44,260 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:09:44,260 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:09:44,261 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:09:44,261 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:09:44,261 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:09:44,262 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:09:44,263 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:09:44,263 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-23 12:09:44,283 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:09:44,283 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:09:44,284 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:09:44,284 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:09:44,288 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:09:44,288 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:09:44,288 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:09:44,289 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:09:44,289 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:09:44,289 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:09:44,289 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:09:44,289 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:09:44,290 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:09:44,290 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:09:44,290 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:09:44,290 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:09:44,290 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:09:44,290 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:09:44,292 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:09:44,292 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:09:44,292 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:09:44,292 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:09:44,292 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:09:44,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:09:44,293 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:09:44,293 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:09:44,293 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:09:44,293 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:09:44,294 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:09:44,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:09:44,294 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:09:44,343 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:09:44,361 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:09:44,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:09:44,367 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:09:44,368 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:09:44,369 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_sentinel_true-unreach-call.i.v+cfa-reducer.c [2018-11-23 12:09:44,448 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38c8e38f3/0cd428b4893b47f7b4e5b5f86260a92a/FLAGd0417d354 [2018-11-23 12:09:44,963 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:09:44,964 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_sentinel_true-unreach-call.i.v+cfa-reducer.c [2018-11-23 12:09:44,973 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38c8e38f3/0cd428b4893b47f7b4e5b5f86260a92a/FLAGd0417d354 [2018-11-23 12:09:45,305 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38c8e38f3/0cd428b4893b47f7b4e5b5f86260a92a [2018-11-23 12:09:45,315 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:09:45,316 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:09:45,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:09:45,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:09:45,321 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:09:45,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:09:45" (1/1) ... [2018-11-23 12:09:45,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@339f1d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:45, skipping insertion in model container [2018-11-23 12:09:45,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:09:45" (1/1) ... [2018-11-23 12:09:45,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:09:45,362 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:09:45,617 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:09:45,624 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:09:45,653 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:09:45,674 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:09:45,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:45 WrapperNode [2018-11-23 12:09:45,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:09:45,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:09:45,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:09:45,676 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:09:45,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:45" (1/1) ... [2018-11-23 12:09:45,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:45" (1/1) ... [2018-11-23 12:09:45,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:09:45,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:09:45,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:09:45,703 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:09:45,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:45" (1/1) ... [2018-11-23 12:09:45,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:45" (1/1) ... [2018-11-23 12:09:45,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:45" (1/1) ... [2018-11-23 12:09:45,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:45" (1/1) ... [2018-11-23 12:09:45,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:45" (1/1) ... [2018-11-23 12:09:45,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:45" (1/1) ... [2018-11-23 12:09:45,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:45" (1/1) ... [2018-11-23 12:09:45,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:09:45,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:09:45,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:09:45,729 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:09:45,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:45" (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-23 12:09:45,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:09:45,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:09:45,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:09:45,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:09:45,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:09:45,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:09:45,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:09:45,855 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:09:45,856 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:09:45,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:09:46,324 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:09:46,325 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 12:09:46,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:09:46 BoogieIcfgContainer [2018-11-23 12:09:46,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:09:46,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:09:46,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:09:46,329 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:09:46,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:09:45" (1/3) ... [2018-11-23 12:09:46,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2959c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:09:46, skipping insertion in model container [2018-11-23 12:09:46,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:09:45" (2/3) ... [2018-11-23 12:09:46,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2959c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:09:46, skipping insertion in model container [2018-11-23 12:09:46,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:09:46" (3/3) ... [2018-11-23 12:09:46,333 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_sentinel_true-unreach-call.i.v+cfa-reducer.c [2018-11-23 12:09:46,342 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:09:46,349 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:09:46,365 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:09:46,399 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:09:46,400 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:09:46,400 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:09:46,400 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:09:46,401 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:09:46,401 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:09:46,401 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:09:46,402 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:09:46,402 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:09:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 12:09:46,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 12:09:46,427 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:46,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:46,431 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:46,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:46,438 INFO L82 PathProgramCache]: Analyzing trace with hash -920288751, now seen corresponding path program 1 times [2018-11-23 12:09:46,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:46,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:46,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:46,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:46,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:46,795 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 12:09:46,799 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__return_main~0 := 0;~__return_60~0 := 0; {20#true} is VALID [2018-11-23 12:09:46,800 INFO L273 TraceCheckUtils]: 2: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 12:09:46,800 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20#true} {20#true} #29#return; {20#true} is VALID [2018-11-23 12:09:46,801 INFO L256 TraceCheckUtils]: 4: Hoare triple {20#true} call #t~ret3 := main(); {20#true} is VALID [2018-11-23 12:09:46,801 INFO L273 TraceCheckUtils]: 5: Hoare triple {20#true} call ~#main__a~0.base, ~#main__a~0.offset := #Ultimate.alloc(400000);havoc ~main__marker~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__marker~0 := #t~nondet0;havoc #t~nondet0;havoc ~main__pos~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__pos~0 := #t~nondet1;havoc #t~nondet1; {20#true} is VALID [2018-11-23 12:09:46,802 INFO L273 TraceCheckUtils]: 6: Hoare triple {20#true} assume ~main__pos~0 >= 0; {22#(<= 0 main_~main__pos~0)} is VALID [2018-11-23 12:09:46,804 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#(<= 0 main_~main__pos~0)} assume ~main__pos~0 < 100000;call write~int(~main__marker~0, ~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__pos~0, 4);~main__i~0 := 0; {23#(and (= main_~main__i~0 0) (<= 0 main_~main__pos~0))} is VALID [2018-11-23 12:09:46,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#(and (= main_~main__i~0 0) (<= 0 main_~main__pos~0))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {23#(and (= main_~main__i~0 0) (<= 0 main_~main__pos~0))} is VALID [2018-11-23 12:09:46,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#(and (= main_~main__i~0 0) (<= 0 main_~main__pos~0))} assume !(#t~mem2 != ~main__marker~0);havoc #t~mem2;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__i~0 <= ~main__pos~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {24#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 12:09:46,823 INFO L273 TraceCheckUtils]: 10: Hoare triple {24#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {21#false} is VALID [2018-11-23 12:09:46,823 INFO L273 TraceCheckUtils]: 11: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 12:09:46,826 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-23 12:09:46,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:09:46,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:09:46,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 12:09:46,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:46,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:09:46,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:46,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:09:46,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:09:46,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:09:46,949 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-11-23 12:09:47,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:47,342 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:09:47,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:09:47,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 12:09:47,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:09:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-23 12:09:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:09:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-23 12:09:47,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2018-11-23 12:09:47,623 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-23 12:09:47,635 INFO L225 Difference]: With dead ends: 30 [2018-11-23 12:09:47,636 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 12:09:47,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:09:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 12:09:47,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 12:09:47,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:47,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 12:09:47,746 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 12:09:47,746 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 12:09:47,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:47,749 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 12:09:47,749 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 12:09:47,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:47,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:47,750 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 12:09:47,750 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 12:09:47,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:47,753 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 12:09:47,754 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 12:09:47,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:47,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:47,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:47,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:47,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:09:47,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 12:09:47,758 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-23 12:09:47,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:47,759 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 12:09:47,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:09:47,759 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 12:09:47,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:09:47,760 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:47,760 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:47,760 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:47,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:47,761 INFO L82 PathProgramCache]: Analyzing trace with hash 363684724, now seen corresponding path program 1 times [2018-11-23 12:09:47,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:47,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:47,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:47,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:47,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:48,488 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 24 [2018-11-23 12:09:48,966 INFO L256 TraceCheckUtils]: 0: Hoare triple {116#true} call ULTIMATE.init(); {116#true} is VALID [2018-11-23 12:09:48,966 INFO L273 TraceCheckUtils]: 1: Hoare triple {116#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__return_main~0 := 0;~__return_60~0 := 0; {116#true} is VALID [2018-11-23 12:09:48,966 INFO L273 TraceCheckUtils]: 2: Hoare triple {116#true} assume true; {116#true} is VALID [2018-11-23 12:09:48,967 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {116#true} {116#true} #29#return; {116#true} is VALID [2018-11-23 12:09:48,967 INFO L256 TraceCheckUtils]: 4: Hoare triple {116#true} call #t~ret3 := main(); {116#true} is VALID [2018-11-23 12:09:48,968 INFO L273 TraceCheckUtils]: 5: Hoare triple {116#true} call ~#main__a~0.base, ~#main__a~0.offset := #Ultimate.alloc(400000);havoc ~main__marker~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__marker~0 := #t~nondet0;havoc #t~nondet0;havoc ~main__pos~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__pos~0 := #t~nondet1;havoc #t~nondet1; {118#(= |main_~#main__a~0.offset| 0)} is VALID [2018-11-23 12:09:48,969 INFO L273 TraceCheckUtils]: 6: Hoare triple {118#(= |main_~#main__a~0.offset| 0)} assume ~main__pos~0 >= 0; {119#(and (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)))} is VALID [2018-11-23 12:09:48,970 INFO L273 TraceCheckUtils]: 7: Hoare triple {119#(and (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)))} assume ~main__pos~0 < 100000;call write~int(~main__marker~0, ~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__pos~0, 4);~main__i~0 := 0; {120#(and (or (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__i~0))))) (= main_~main__i~0 0) (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)))} is VALID [2018-11-23 12:09:48,972 INFO L273 TraceCheckUtils]: 8: Hoare triple {120#(and (or (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__i~0))))) (= main_~main__i~0 0) (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {121#(and (= main_~main__i~0 0) (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)) (or (= |main_#t~mem2| main_~main__marker~0) (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0))))} is VALID [2018-11-23 12:09:48,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {121#(and (= main_~main__i~0 0) (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)) (or (= |main_#t~mem2| main_~main__marker~0) (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0))))} assume #t~mem2 != ~main__marker~0;havoc #t~mem2;~main__i~0 := 1 + ~main__i~0; {122#(and (<= main_~main__i~0 1) (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)))} is VALID [2018-11-23 12:09:48,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {122#(and (<= main_~main__i~0 1) (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {123#(<= main_~main__i~0 main_~main__pos~0)} is VALID [2018-11-23 12:09:48,976 INFO L273 TraceCheckUtils]: 11: Hoare triple {123#(<= main_~main__i~0 main_~main__pos~0)} assume !(#t~mem2 != ~main__marker~0);havoc #t~mem2;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__i~0 <= ~main__pos~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {124#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 12:09:48,980 INFO L273 TraceCheckUtils]: 12: Hoare triple {124#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {117#false} is VALID [2018-11-23 12:09:48,981 INFO L273 TraceCheckUtils]: 13: Hoare triple {117#false} assume !false; {117#false} is VALID [2018-11-23 12:09:48,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:48,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:48,983 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-23 12:09:48,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:49,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:49,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 12:09:49,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 12:09:49,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:09:49,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:09:49,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:09:49,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-23 12:09:49,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 12:09:49,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2018-11-23 12:09:49,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 12:09:49,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:09:49,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 12:09:49,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:30 [2018-11-23 12:09:49,641 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:09:49,641 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#main__a~0.base|, |main_~#main__a~0.offset|]. (let ((.cse0 (select |#memory_int| |main_~#main__a~0.base|))) (and (= main_~main__marker~0 (select .cse0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (<= main_~main__i~0 0) (= (select .cse0 (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem2|) (<= 0 main_~main__pos~0))) [2018-11-23 12:09:49,642 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#main__a~0.offset|]. (let ((.cse0 (<= main_~main__i~0 0)) (.cse1 (<= 0 main_~main__pos~0))) (or (and .cse0 (not (= (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) .cse1) (and (= |main_#t~mem2| main_~main__marker~0) .cse0 .cse1))) [2018-11-23 12:09:49,838 INFO L256 TraceCheckUtils]: 0: Hoare triple {116#true} call ULTIMATE.init(); {116#true} is VALID [2018-11-23 12:09:49,839 INFO L273 TraceCheckUtils]: 1: Hoare triple {116#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__return_main~0 := 0;~__return_60~0 := 0; {116#true} is VALID [2018-11-23 12:09:49,839 INFO L273 TraceCheckUtils]: 2: Hoare triple {116#true} assume true; {116#true} is VALID [2018-11-23 12:09:49,839 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {116#true} {116#true} #29#return; {116#true} is VALID [2018-11-23 12:09:49,839 INFO L256 TraceCheckUtils]: 4: Hoare triple {116#true} call #t~ret3 := main(); {116#true} is VALID [2018-11-23 12:09:49,840 INFO L273 TraceCheckUtils]: 5: Hoare triple {116#true} call ~#main__a~0.base, ~#main__a~0.offset := #Ultimate.alloc(400000);havoc ~main__marker~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__marker~0 := #t~nondet0;havoc #t~nondet0;havoc ~main__pos~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__pos~0 := #t~nondet1;havoc #t~nondet1; {116#true} is VALID [2018-11-23 12:09:49,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {116#true} assume ~main__pos~0 >= 0; {146#(<= 0 main_~main__pos~0)} is VALID [2018-11-23 12:09:49,841 INFO L273 TraceCheckUtils]: 7: Hoare triple {146#(<= 0 main_~main__pos~0)} assume ~main__pos~0 < 100000;call write~int(~main__marker~0, ~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__pos~0, 4);~main__i~0 := 0; {150#(and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (<= main_~main__i~0 0) (<= 0 main_~main__pos~0))} is VALID [2018-11-23 12:09:49,842 INFO L273 TraceCheckUtils]: 8: Hoare triple {150#(and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (<= main_~main__i~0 0) (<= 0 main_~main__pos~0))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {154#(or (and (= |main_#t~mem2| main_~main__marker~0) (<= main_~main__i~0 0) (<= 0 main_~main__pos~0)) (and (<= main_~main__i~0 0) (<= 0 main_~main__pos~0) (not (= (* 4 main_~main__i~0) (* 4 main_~main__pos~0)))))} is VALID [2018-11-23 12:09:49,843 INFO L273 TraceCheckUtils]: 9: Hoare triple {154#(or (and (= |main_#t~mem2| main_~main__marker~0) (<= main_~main__i~0 0) (<= 0 main_~main__pos~0)) (and (<= main_~main__i~0 0) (<= 0 main_~main__pos~0) (not (= (* 4 main_~main__i~0) (* 4 main_~main__pos~0)))))} assume #t~mem2 != ~main__marker~0;havoc #t~mem2;~main__i~0 := 1 + ~main__i~0; {158#(and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__i~0 1) (<= 0 main_~main__pos~0))} is VALID [2018-11-23 12:09:49,845 INFO L273 TraceCheckUtils]: 10: Hoare triple {158#(and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__i~0 1) (<= 0 main_~main__pos~0))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {158#(and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__i~0 1) (<= 0 main_~main__pos~0))} is VALID [2018-11-23 12:09:49,846 INFO L273 TraceCheckUtils]: 11: Hoare triple {158#(and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__i~0 1) (<= 0 main_~main__pos~0))} assume !(#t~mem2 != ~main__marker~0);havoc #t~mem2;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__i~0 <= ~main__pos~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {124#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 12:09:49,847 INFO L273 TraceCheckUtils]: 12: Hoare triple {124#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {117#false} is VALID [2018-11-23 12:09:49,847 INFO L273 TraceCheckUtils]: 13: Hoare triple {117#false} assume !false; {117#false} is VALID [2018-11-23 12:09:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:49,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:49,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2018-11-23 12:09:49,880 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-11-23 12:09:49,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:49,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:09:49,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:49,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:09:49,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:09:49,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:09:49,989 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2018-11-23 12:09:50,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:50,483 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 12:09:50,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:09:50,484 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-11-23 12:09:50,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:09:50,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-23 12:09:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:09:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-23 12:09:50,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 20 transitions. [2018-11-23 12:09:50,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:50,552 INFO L225 Difference]: With dead ends: 20 [2018-11-23 12:09:50,552 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 12:09:50,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:09:50,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 12:09:50,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 12:09:50,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:50,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 12:09:50,672 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 12:09:50,672 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 12:09:50,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:50,674 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 12:09:50,674 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 12:09:50,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:50,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:50,675 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 12:09:50,675 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 12:09:50,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:50,677 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 12:09:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 12:09:50,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:50,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:50,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:50,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:50,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:09:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 12:09:50,681 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-11-23 12:09:50,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:50,681 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 12:09:50,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:09:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 12:09:50,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:09:50,682 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:50,682 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:50,683 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:50,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:50,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1606580247, now seen corresponding path program 2 times [2018-11-23 12:09:50,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:50,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:50,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:50,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:09:50,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:51,375 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 30 [2018-11-23 12:09:51,793 INFO L256 TraceCheckUtils]: 0: Hoare triple {261#true} call ULTIMATE.init(); {261#true} is VALID [2018-11-23 12:09:51,794 INFO L273 TraceCheckUtils]: 1: Hoare triple {261#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__return_main~0 := 0;~__return_60~0 := 0; {261#true} is VALID [2018-11-23 12:09:51,794 INFO L273 TraceCheckUtils]: 2: Hoare triple {261#true} assume true; {261#true} is VALID [2018-11-23 12:09:51,794 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {261#true} {261#true} #29#return; {261#true} is VALID [2018-11-23 12:09:51,795 INFO L256 TraceCheckUtils]: 4: Hoare triple {261#true} call #t~ret3 := main(); {261#true} is VALID [2018-11-23 12:09:51,797 INFO L273 TraceCheckUtils]: 5: Hoare triple {261#true} call ~#main__a~0.base, ~#main__a~0.offset := #Ultimate.alloc(400000);havoc ~main__marker~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__marker~0 := #t~nondet0;havoc #t~nondet0;havoc ~main__pos~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__pos~0 := #t~nondet1;havoc #t~nondet1; {263#(= |main_~#main__a~0.offset| 0)} is VALID [2018-11-23 12:09:51,798 INFO L273 TraceCheckUtils]: 6: Hoare triple {263#(= |main_~#main__a~0.offset| 0)} assume ~main__pos~0 >= 0; {264#(and (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)))} is VALID [2018-11-23 12:09:51,799 INFO L273 TraceCheckUtils]: 7: Hoare triple {264#(and (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)))} assume ~main__pos~0 < 100000;call write~int(~main__marker~0, ~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__pos~0, 4);~main__i~0 := 0; {265#(and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__pos~0) |main_~#main__a~0.offset|))) (= main_~main__i~0 0) (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)))} is VALID [2018-11-23 12:09:51,800 INFO L273 TraceCheckUtils]: 8: Hoare triple {265#(and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__pos~0) |main_~#main__a~0.offset|))) (= main_~main__i~0 0) (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {266#(and (= main_~main__i~0 0) (= |main_~#main__a~0.offset| 0) (or (and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__pos~0) |main_~#main__a~0.offset|))) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1))) (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (or (= |main_#t~mem2| main_~main__marker~0) (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0))))} is VALID [2018-11-23 12:09:51,803 INFO L273 TraceCheckUtils]: 9: Hoare triple {266#(and (= main_~main__i~0 0) (= |main_~#main__a~0.offset| 0) (or (and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__pos~0) |main_~#main__a~0.offset|))) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1))) (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (or (= |main_#t~mem2| main_~main__marker~0) (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0))))} assume #t~mem2 != ~main__marker~0;havoc #t~mem2;~main__i~0 := 1 + ~main__i~0; {267#(and (or (= main_~main__pos~0 main_~main__i~0) (and (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)) (< main_~main__i~0 (+ main_~main__pos~0 1)))) (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (or (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__i~0)))) (not (= main_~main__pos~0 main_~main__i~0))) (= |main_~#main__a~0.offset| 0))} is VALID [2018-11-23 12:09:51,804 INFO L273 TraceCheckUtils]: 10: Hoare triple {267#(and (or (= main_~main__pos~0 main_~main__i~0) (and (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)) (< main_~main__i~0 (+ main_~main__pos~0 1)))) (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (or (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__i~0)))) (not (= main_~main__pos~0 main_~main__i~0))) (= |main_~#main__a~0.offset| 0))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {268#(and (or (= main_~main__pos~0 main_~main__i~0) (and (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)) (< main_~main__i~0 (+ main_~main__pos~0 1)))) (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (or (= |main_#t~mem2| main_~main__marker~0) (not (= main_~main__pos~0 main_~main__i~0))) (= |main_~#main__a~0.offset| 0))} is VALID [2018-11-23 12:09:51,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {268#(and (or (= main_~main__pos~0 main_~main__i~0) (and (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)) (< main_~main__i~0 (+ main_~main__pos~0 1)))) (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (or (= |main_#t~mem2| main_~main__marker~0) (not (= main_~main__pos~0 main_~main__i~0))) (= |main_~#main__a~0.offset| 0))} assume #t~mem2 != ~main__marker~0;havoc #t~mem2;~main__i~0 := 1 + ~main__i~0; {269#(and (<= main_~main__i~0 main_~main__pos~0) (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)))} is VALID [2018-11-23 12:09:51,817 INFO L273 TraceCheckUtils]: 12: Hoare triple {269#(and (<= main_~main__i~0 main_~main__pos~0) (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {270#(<= main_~main__i~0 main_~main__pos~0)} is VALID [2018-11-23 12:09:51,822 INFO L273 TraceCheckUtils]: 13: Hoare triple {270#(<= main_~main__i~0 main_~main__pos~0)} assume !(#t~mem2 != ~main__marker~0);havoc #t~mem2;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__i~0 <= ~main__pos~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {271#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 12:09:51,823 INFO L273 TraceCheckUtils]: 14: Hoare triple {271#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {262#false} is VALID [2018-11-23 12:09:51,823 INFO L273 TraceCheckUtils]: 15: Hoare triple {262#false} assume !false; {262#false} is VALID [2018-11-23 12:09:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:51,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:51,825 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:51,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:09:51,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:09:51,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:51,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:51,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 12:09:51,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 12:09:51,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:09:51,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:09:51,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:09:51,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-23 12:09:52,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-23 12:09:52,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 41 [2018-11-23 12:09:52,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-23 12:09:52,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:09:52,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 12:09:52,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:58 [2018-11-23 12:09:52,276 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:09:52,276 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#main__a~0.base|, |main_~#main__a~0.offset|]. (let ((.cse0 (select |#memory_int| |main_~#main__a~0.base|))) (and (<= main_~main__i~0 1) (not (= (select .cse0 |main_~#main__a~0.offset|) main_~main__marker~0)) (= main_~main__marker~0 (select .cse0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (= (select .cse0 (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem2|) (<= 0 main_~main__pos~0))) [2018-11-23 12:09:52,276 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#main__a~0.offset|, v_prenex_1]. (let ((.cse0 (<= main_~main__i~0 1)) (.cse5 (* 4 main_~main__pos~0)) (.cse4 (= |main_#t~mem2| main_~main__marker~0)) (.cse3 (<= 0 main_~main__pos~0)) (.cse2 (* 4 main_~main__i~0))) (or (let ((.cse1 (+ |main_~#main__a~0.offset| .cse5))) (and .cse0 (not (= .cse1 |main_~#main__a~0.offset|)) (not (= (+ .cse2 |main_~#main__a~0.offset|) .cse1)) .cse3 (not .cse4))) (and .cse0 (not (= (+ v_prenex_1 .cse5) v_prenex_1)) .cse4 .cse3 (not (= (+ .cse2 v_prenex_1) v_prenex_1))))) [2018-11-23 12:09:52,710 INFO L256 TraceCheckUtils]: 0: Hoare triple {261#true} call ULTIMATE.init(); {261#true} is VALID [2018-11-23 12:09:52,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {261#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__return_main~0 := 0;~__return_60~0 := 0; {261#true} is VALID [2018-11-23 12:09:52,711 INFO L273 TraceCheckUtils]: 2: Hoare triple {261#true} assume true; {261#true} is VALID [2018-11-23 12:09:52,711 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {261#true} {261#true} #29#return; {261#true} is VALID [2018-11-23 12:09:52,712 INFO L256 TraceCheckUtils]: 4: Hoare triple {261#true} call #t~ret3 := main(); {261#true} is VALID [2018-11-23 12:09:52,712 INFO L273 TraceCheckUtils]: 5: Hoare triple {261#true} call ~#main__a~0.base, ~#main__a~0.offset := #Ultimate.alloc(400000);havoc ~main__marker~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__marker~0 := #t~nondet0;havoc #t~nondet0;havoc ~main__pos~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__pos~0 := #t~nondet1;havoc #t~nondet1; {261#true} is VALID [2018-11-23 12:09:52,714 INFO L273 TraceCheckUtils]: 6: Hoare triple {261#true} assume ~main__pos~0 >= 0; {293#(<= 0 main_~main__pos~0)} is VALID [2018-11-23 12:09:52,715 INFO L273 TraceCheckUtils]: 7: Hoare triple {293#(<= 0 main_~main__pos~0)} assume ~main__pos~0 < 100000;call write~int(~main__marker~0, ~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__pos~0, 4);~main__i~0 := 0; {297#(and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (= 0 main_~main__i~0) (<= 0 main_~main__pos~0))} is VALID [2018-11-23 12:09:52,717 INFO L273 TraceCheckUtils]: 8: Hoare triple {297#(and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (= 0 main_~main__i~0) (<= 0 main_~main__pos~0))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {301#(and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem2|) (= 0 main_~main__i~0) (<= 0 main_~main__pos~0))} is VALID [2018-11-23 12:09:52,718 INFO L273 TraceCheckUtils]: 9: Hoare triple {301#(and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem2|) (= 0 main_~main__i~0) (<= 0 main_~main__pos~0))} assume #t~mem2 != ~main__marker~0;havoc #t~mem2;~main__i~0 := 1 + ~main__i~0; {305#(and (<= main_~main__i~0 1) (not (= (select (select |#memory_int| |main_~#main__a~0.base|) |main_~#main__a~0.offset|) main_~main__marker~0)) (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (<= 0 main_~main__pos~0))} is VALID [2018-11-23 12:09:52,720 INFO L273 TraceCheckUtils]: 10: Hoare triple {305#(and (<= main_~main__i~0 1) (not (= (select (select |#memory_int| |main_~#main__a~0.base|) |main_~#main__a~0.offset|) main_~main__marker~0)) (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (<= 0 main_~main__pos~0))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {309#(or (and (<= main_~main__i~0 1) (not (= (* 4 main_~main__pos~0) 0)) (<= 0 main_~main__pos~0) (not (= (* 4 main_~main__i~0) (* 4 main_~main__pos~0))) (not (= |main_#t~mem2| main_~main__marker~0))) (and (<= main_~main__i~0 1) (= |main_#t~mem2| main_~main__marker~0) (not (= (* 4 main_~main__i~0) 0)) (not (= (* 4 main_~main__pos~0) 0)) (<= 0 main_~main__pos~0)))} is VALID [2018-11-23 12:09:52,722 INFO L273 TraceCheckUtils]: 11: Hoare triple {309#(or (and (<= main_~main__i~0 1) (not (= (* 4 main_~main__pos~0) 0)) (<= 0 main_~main__pos~0) (not (= (* 4 main_~main__i~0) (* 4 main_~main__pos~0))) (not (= |main_#t~mem2| main_~main__marker~0))) (and (<= main_~main__i~0 1) (= |main_#t~mem2| main_~main__marker~0) (not (= (* 4 main_~main__i~0) 0)) (not (= (* 4 main_~main__pos~0) 0)) (<= 0 main_~main__pos~0)))} assume #t~mem2 != ~main__marker~0;havoc #t~mem2;~main__i~0 := 1 + ~main__i~0; {313#(and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__i~0 2) (not (= (* 4 main_~main__pos~0) 0)) (<= 0 main_~main__pos~0))} is VALID [2018-11-23 12:09:52,723 INFO L273 TraceCheckUtils]: 12: Hoare triple {313#(and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__i~0 2) (not (= (* 4 main_~main__pos~0) 0)) (<= 0 main_~main__pos~0))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {313#(and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__i~0 2) (not (= (* 4 main_~main__pos~0) 0)) (<= 0 main_~main__pos~0))} is VALID [2018-11-23 12:09:52,724 INFO L273 TraceCheckUtils]: 13: Hoare triple {313#(and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__i~0 2) (not (= (* 4 main_~main__pos~0) 0)) (<= 0 main_~main__pos~0))} assume !(#t~mem2 != ~main__marker~0);havoc #t~mem2;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__i~0 <= ~main__pos~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {271#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 12:09:52,726 INFO L273 TraceCheckUtils]: 14: Hoare triple {271#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {262#false} is VALID [2018-11-23 12:09:52,727 INFO L273 TraceCheckUtils]: 15: Hoare triple {262#false} assume !false; {262#false} is VALID [2018-11-23 12:09:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:09:52,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:09:52,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-11-23 12:09:52,754 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-11-23 12:09:52,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:09:52,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:09:52,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:52,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:09:52,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:09:52,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:09:52,794 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-11-23 12:09:53,401 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 33 [2018-11-23 12:09:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:54,025 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 12:09:54,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:09:54,025 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-11-23 12:09:54,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:09:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:09:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2018-11-23 12:09:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:09:54,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2018-11-23 12:09:54,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 26 transitions. [2018-11-23 12:09:54,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:09:54,081 INFO L225 Difference]: With dead ends: 25 [2018-11-23 12:09:54,082 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 12:09:54,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:09:54,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 12:09:54,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 12:09:54,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:09:54,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 12:09:54,119 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 12:09:54,120 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 12:09:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:54,122 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 12:09:54,122 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 12:09:54,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:54,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:54,123 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 12:09:54,123 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 12:09:54,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:09:54,125 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 12:09:54,125 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 12:09:54,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:09:54,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:09:54,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:09:54,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:09:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:09:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 12:09:54,128 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-11-23 12:09:54,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:09:54,129 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 12:09:54,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:09:54,129 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 12:09:54,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:09:54,130 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:09:54,130 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:09:54,130 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:09:54,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:09:54,131 INFO L82 PathProgramCache]: Analyzing trace with hash -750191843, now seen corresponding path program 3 times [2018-11-23 12:09:54,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:09:54,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:09:54,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:54,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:09:54,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:09:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:55,188 WARN L180 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 33 [2018-11-23 12:09:56,014 INFO L256 TraceCheckUtils]: 0: Hoare triple {445#true} call ULTIMATE.init(); {445#true} is VALID [2018-11-23 12:09:56,015 INFO L273 TraceCheckUtils]: 1: Hoare triple {445#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__return_main~0 := 0;~__return_60~0 := 0; {445#true} is VALID [2018-11-23 12:09:56,016 INFO L273 TraceCheckUtils]: 2: Hoare triple {445#true} assume true; {445#true} is VALID [2018-11-23 12:09:56,016 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {445#true} {445#true} #29#return; {445#true} is VALID [2018-11-23 12:09:56,016 INFO L256 TraceCheckUtils]: 4: Hoare triple {445#true} call #t~ret3 := main(); {445#true} is VALID [2018-11-23 12:09:56,017 INFO L273 TraceCheckUtils]: 5: Hoare triple {445#true} call ~#main__a~0.base, ~#main__a~0.offset := #Ultimate.alloc(400000);havoc ~main__marker~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__marker~0 := #t~nondet0;havoc #t~nondet0;havoc ~main__pos~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__pos~0 := #t~nondet1;havoc #t~nondet1; {447#(= |main_~#main__a~0.offset| 0)} is VALID [2018-11-23 12:09:56,018 INFO L273 TraceCheckUtils]: 6: Hoare triple {447#(= |main_~#main__a~0.offset| 0)} assume ~main__pos~0 >= 0; {448#(and (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)))} is VALID [2018-11-23 12:09:56,019 INFO L273 TraceCheckUtils]: 7: Hoare triple {448#(and (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)))} assume ~main__pos~0 < 100000;call write~int(~main__marker~0, ~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__pos~0, 4);~main__i~0 := 0; {449#(and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__pos~0) |main_~#main__a~0.offset|))) (= main_~main__i~0 0) (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)))} is VALID [2018-11-23 12:09:56,020 INFO L273 TraceCheckUtils]: 8: Hoare triple {449#(and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__pos~0) |main_~#main__a~0.offset|))) (= main_~main__i~0 0) (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {450#(and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__pos~0) |main_~#main__a~0.offset|))) (= main_~main__i~0 0) (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)) (or (= |main_#t~mem2| main_~main__marker~0) (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0))))} is VALID [2018-11-23 12:09:56,038 INFO L273 TraceCheckUtils]: 9: Hoare triple {450#(and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__pos~0) |main_~#main__a~0.offset|))) (= main_~main__i~0 0) (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)) (or (= |main_#t~mem2| main_~main__marker~0) (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0))))} assume #t~mem2 != ~main__marker~0;havoc #t~mem2;~main__i~0 := 1 + ~main__i~0; {451#(and (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (or (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__i~0)))) (not (= main_~main__pos~0 main_~main__i~0))) (= |main_~#main__a~0.offset| 0) (or (and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__pos~0) |main_~#main__a~0.offset|))) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)) (< main_~main__i~0 (+ main_~main__pos~0 1))) (= main_~main__pos~0 main_~main__i~0)))} is VALID [2018-11-23 12:09:56,052 INFO L273 TraceCheckUtils]: 10: Hoare triple {451#(and (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (or (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__i~0)))) (not (= main_~main__pos~0 main_~main__i~0))) (= |main_~#main__a~0.offset| 0) (or (and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__pos~0) |main_~#main__a~0.offset|))) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)) (< main_~main__i~0 (+ main_~main__pos~0 1))) (= main_~main__pos~0 main_~main__i~0)))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {452#(and (or (= main_~main__pos~0 main_~main__i~0) (and (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)) (< main_~main__i~0 (+ main_~main__pos~0 1)))) (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__pos~0) |main_~#main__a~0.offset|))) (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (or (= |main_#t~mem2| main_~main__marker~0) (not (= main_~main__pos~0 main_~main__i~0))) (= |main_~#main__a~0.offset| 0))} is VALID [2018-11-23 12:09:56,066 INFO L273 TraceCheckUtils]: 11: Hoare triple {452#(and (or (= main_~main__pos~0 main_~main__i~0) (and (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)) (< main_~main__i~0 (+ main_~main__pos~0 1)))) (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__pos~0) |main_~#main__a~0.offset|))) (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (or (= |main_#t~mem2| main_~main__marker~0) (not (= main_~main__pos~0 main_~main__i~0))) (= |main_~#main__a~0.offset| 0))} assume #t~mem2 != ~main__marker~0;havoc #t~mem2;~main__i~0 := 1 + ~main__i~0; {451#(and (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (or (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__i~0)))) (not (= main_~main__pos~0 main_~main__i~0))) (= |main_~#main__a~0.offset| 0) (or (and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__pos~0) |main_~#main__a~0.offset|))) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)) (< main_~main__i~0 (+ main_~main__pos~0 1))) (= main_~main__pos~0 main_~main__i~0)))} is VALID [2018-11-23 12:09:56,081 INFO L273 TraceCheckUtils]: 12: Hoare triple {451#(and (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (or (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__i~0)))) (not (= main_~main__pos~0 main_~main__i~0))) (= |main_~#main__a~0.offset| 0) (or (and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__pos~0) |main_~#main__a~0.offset|))) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)) (< main_~main__i~0 (+ main_~main__pos~0 1))) (= main_~main__pos~0 main_~main__i~0)))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {452#(and (or (= main_~main__pos~0 main_~main__i~0) (and (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)) (< main_~main__i~0 (+ main_~main__pos~0 1)))) (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__pos~0) |main_~#main__a~0.offset|))) (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (or (= |main_#t~mem2| main_~main__marker~0) (not (= main_~main__pos~0 main_~main__i~0))) (= |main_~#main__a~0.offset| 0))} is VALID [2018-11-23 12:09:56,083 INFO L273 TraceCheckUtils]: 13: Hoare triple {452#(and (or (= main_~main__pos~0 main_~main__i~0) (and (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)) (< main_~main__i~0 (+ main_~main__pos~0 1)))) (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__pos~0) |main_~#main__a~0.offset|))) (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (or (= |main_#t~mem2| main_~main__marker~0) (not (= main_~main__pos~0 main_~main__i~0))) (= |main_~#main__a~0.offset| 0))} assume #t~mem2 != ~main__marker~0;havoc #t~mem2;~main__i~0 := 1 + ~main__i~0; {453#(and (or (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__i~0)))) (not (= main_~main__pos~0 main_~main__i~0))) (= |main_~#main__a~0.offset| 0) (or (and (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)) (< main_~main__i~0 (+ main_~main__pos~0 1))) (= main_~main__pos~0 main_~main__i~0)))} is VALID [2018-11-23 12:09:56,084 INFO L273 TraceCheckUtils]: 14: Hoare triple {453#(and (or (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__i~0)))) (not (= main_~main__pos~0 main_~main__i~0))) (= |main_~#main__a~0.offset| 0) (or (and (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)) (< main_~main__i~0 (+ main_~main__pos~0 1))) (= main_~main__pos~0 main_~main__i~0)))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {454#(and (or (= |main_#t~mem2| main_~main__marker~0) (not (= main_~main__pos~0 main_~main__i~0))) (= |main_~#main__a~0.offset| 0) (or (and (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)) (< main_~main__i~0 (+ main_~main__pos~0 1))) (= main_~main__pos~0 main_~main__i~0)))} is VALID [2018-11-23 12:09:56,085 INFO L273 TraceCheckUtils]: 15: Hoare triple {454#(and (or (= |main_#t~mem2| main_~main__marker~0) (not (= main_~main__pos~0 main_~main__i~0))) (= |main_~#main__a~0.offset| 0) (or (and (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)) (< main_~main__i~0 (+ main_~main__pos~0 1))) (= main_~main__pos~0 main_~main__i~0)))} assume #t~mem2 != ~main__marker~0;havoc #t~mem2;~main__i~0 := 1 + ~main__i~0; {455#(and (<= main_~main__i~0 main_~main__pos~0) (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)))} is VALID [2018-11-23 12:09:56,085 INFO L273 TraceCheckUtils]: 16: Hoare triple {455#(and (<= main_~main__i~0 main_~main__pos~0) (not (= (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)) 0)) (= |main_~#main__a~0.offset| 0) (< 0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0) 1)))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {456#(<= main_~main__i~0 main_~main__pos~0)} is VALID [2018-11-23 12:09:56,086 INFO L273 TraceCheckUtils]: 17: Hoare triple {456#(<= main_~main__i~0 main_~main__pos~0)} assume !(#t~mem2 != ~main__marker~0);havoc #t~mem2;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__i~0 <= ~main__pos~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {457#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 12:09:56,087 INFO L273 TraceCheckUtils]: 18: Hoare triple {457#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {446#false} is VALID [2018-11-23 12:09:56,088 INFO L273 TraceCheckUtils]: 19: Hoare triple {446#false} assume !false; {446#false} is VALID [2018-11-23 12:09:56,091 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:09:56,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:09:56,091 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:09:56,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:09:56,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 12:09:56,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:09:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:09:56,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:09:56,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 12:09:56,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 12:09:56,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:09:56,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:09:56,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:09:56,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-23 12:09:58,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2018-11-23 12:09:58,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 145 [2018-11-23 12:09:58,738 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-23 12:09:59,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 72 xjuncts. [2018-11-23 12:09:59,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:09:59,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 12 dim-0 vars, and 2 xjuncts. [2018-11-23 12:09:59,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:71, output treesize:417 [2018-11-23 12:09:59,760 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:09:59,760 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#main__a~0.base|, v_main_~main__i~0_11, |main_~#main__a~0.offset|, v_main_~main__i~0_10]. (let ((.cse0 (select |#memory_int| |main_~#main__a~0.base|))) (and (not (= main_~main__marker~0 (select .cse0 (+ (* 4 v_main_~main__i~0_11) |main_~#main__a~0.offset|)))) (not (= main_~main__marker~0 (select .cse0 (+ (* 4 v_main_~main__i~0_10) |main_~#main__a~0.offset|)))) (not (= (select .cse0 |main_~#main__a~0.offset|) main_~main__marker~0)) (= main_~main__marker~0 (select .cse0 (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (= (select .cse0 (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem2|) (<= main_~main__i~0 (+ v_main_~main__i~0_11 1)) (<= v_main_~main__i~0_10 1) (<= 0 main_~main__pos~0) (<= v_main_~main__i~0_11 (+ v_main_~main__i~0_10 1)))) [2018-11-23 12:09:59,761 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_4, v_prenex_12, v_prenex_11, v_prenex_7, v_prenex_6, v_prenex_10, v_prenex_9, v_prenex_5, v_prenex_8, |main_~#main__a~0.offset|, v_prenex_2, v_prenex_3]. (let ((.cse13 (+ main_~main__pos~0 1))) (let ((.cse4 (<= main_~main__i~0 .cse13)) (.cse1 (<= main_~main__i~0 main_~main__pos~0)) (.cse0 (<= main_~main__i~0 3)) (.cse5 (* 4 main_~main__pos~0)) (.cse9 (<= main_~main__pos~0 1)) (.cse7 (<= main_~main__pos~0 0)) (.cse3 (* 4 main_~main__i~0)) (.cse11 (= |main_#t~mem2| main_~main__marker~0)) (.cse10 (<= 0 main_~main__pos~0))) (or (and (or (let ((.cse2 (+ |main_~#main__a~0.offset| .cse5))) (and .cse0 .cse1 (not (= .cse2 |main_~#main__a~0.offset|)) (not (= (+ .cse3 |main_~#main__a~0.offset|) .cse2)) .cse4)) (let ((.cse6 (+ v_prenex_2 .cse5))) (and .cse0 .cse1 (not (= .cse6 v_prenex_2)) (not (= (+ .cse3 v_prenex_2) .cse6)) .cse7)) (let ((.cse8 (+ v_prenex_3 .cse5))) (and .cse0 (not (= .cse8 v_prenex_3)) .cse9 (not (= (+ .cse3 v_prenex_3) .cse8)) .cse7))) .cse10 (not .cse11)) (and (let ((.cse14 (<= (+ main_~main__pos~0 2) main_~main__i~0)) (.cse15 (<= (+ main_~main__i~0 2) main_~main__pos~0)) (.cse16 (<= main_~main__i~0 1)) (.cse12 (<= main_~main__i~0 0))) (or (and .cse0 .cse1 (not (= (+ v_prenex_4 .cse5) v_prenex_4)) .cse12 .cse7 (not (= (+ .cse3 v_prenex_4) v_prenex_4))) (and .cse0 (not (= (+ v_prenex_12 .cse5) v_prenex_12)) (<= .cse13 main_~main__i~0) .cse9 .cse14 .cse7 (not (= (+ .cse3 v_prenex_12) v_prenex_12))) (and .cse0 .cse1 (not (= (+ v_prenex_11 .cse5) v_prenex_11)) .cse14 .cse7 (not (= (+ .cse3 v_prenex_11) v_prenex_11))) (and .cse0 .cse1 (not (= (+ v_prenex_7 .cse5) v_prenex_7)) .cse12 .cse4 .cse15 (not (= (+ .cse3 v_prenex_7) v_prenex_7))) (and .cse0 .cse16 .cse1 (not (= (+ v_prenex_6 .cse5) v_prenex_6)) (<= (+ main_~main__i~0 1) main_~main__pos~0) .cse12 .cse4 .cse15 (not (= (+ .cse3 v_prenex_6) v_prenex_6))) (and .cse0 .cse1 (not (= (+ v_prenex_10 .cse5) v_prenex_10)) .cse4 (not (= (+ .cse3 v_prenex_10) v_prenex_10))) (and .cse0 (not (= (+ v_prenex_9 .cse5) v_prenex_9)) .cse9 .cse14 .cse12 .cse7 (not (= (+ .cse3 v_prenex_9) v_prenex_9))) (and .cse0 .cse16 .cse1 (not (= (+ v_prenex_5 .cse5) v_prenex_5)) .cse12 .cse15 .cse7 (not (= (+ .cse3 v_prenex_5) v_prenex_5))) (and .cse0 .cse16 (not (= (+ v_prenex_8 .cse5) v_prenex_8)) .cse9 .cse12 .cse7 (not (= (+ .cse3 v_prenex_8) v_prenex_8))))) .cse11 .cse10)))) [2018-11-23 12:10:00,128 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 25 [2018-11-23 12:10:00,255 INFO L256 TraceCheckUtils]: 0: Hoare triple {445#true} call ULTIMATE.init(); {445#true} is VALID [2018-11-23 12:10:00,255 INFO L273 TraceCheckUtils]: 1: Hoare triple {445#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~__return_main~0 := 0;~__return_60~0 := 0; {445#true} is VALID [2018-11-23 12:10:00,255 INFO L273 TraceCheckUtils]: 2: Hoare triple {445#true} assume true; {445#true} is VALID [2018-11-23 12:10:00,255 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {445#true} {445#true} #29#return; {445#true} is VALID [2018-11-23 12:10:00,256 INFO L256 TraceCheckUtils]: 4: Hoare triple {445#true} call #t~ret3 := main(); {445#true} is VALID [2018-11-23 12:10:00,256 INFO L273 TraceCheckUtils]: 5: Hoare triple {445#true} call ~#main__a~0.base, ~#main__a~0.offset := #Ultimate.alloc(400000);havoc ~main__marker~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__marker~0 := #t~nondet0;havoc #t~nondet0;havoc ~main__pos~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__pos~0 := #t~nondet1;havoc #t~nondet1; {445#true} is VALID [2018-11-23 12:10:00,256 INFO L273 TraceCheckUtils]: 6: Hoare triple {445#true} assume ~main__pos~0 >= 0; {479#(<= 0 main_~main__pos~0)} is VALID [2018-11-23 12:10:00,257 INFO L273 TraceCheckUtils]: 7: Hoare triple {479#(<= 0 main_~main__pos~0)} assume ~main__pos~0 < 100000;call write~int(~main__marker~0, ~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__pos~0, 4);~main__i~0 := 0; {483#(and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (= 0 main_~main__i~0) (<= 0 main_~main__pos~0))} is VALID [2018-11-23 12:10:00,258 INFO L273 TraceCheckUtils]: 8: Hoare triple {483#(and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (= 0 main_~main__i~0) (<= 0 main_~main__pos~0))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {487#(and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem2|) (= 0 main_~main__i~0) (<= 0 main_~main__pos~0))} is VALID [2018-11-23 12:10:00,259 INFO L273 TraceCheckUtils]: 9: Hoare triple {487#(and (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem2|) (= 0 main_~main__i~0) (<= 0 main_~main__pos~0))} assume #t~mem2 != ~main__marker~0;havoc #t~mem2;~main__i~0 := 1 + ~main__i~0; {491#(and (<= main_~main__i~0 1) (not (= (select (select |#memory_int| |main_~#main__a~0.base|) |main_~#main__a~0.offset|) main_~main__marker~0)) (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (<= 0 main_~main__pos~0))} is VALID [2018-11-23 12:10:00,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {491#(and (<= main_~main__i~0 1) (not (= (select (select |#memory_int| |main_~#main__a~0.base|) |main_~#main__a~0.offset|) main_~main__marker~0)) (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (<= 0 main_~main__pos~0))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {495#(and (<= main_~main__i~0 1) (not (= (select (select |#memory_int| |main_~#main__a~0.base|) |main_~#main__a~0.offset|) main_~main__marker~0)) (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem2|) (<= 0 main_~main__pos~0))} is VALID [2018-11-23 12:10:00,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {495#(and (<= main_~main__i~0 1) (not (= (select (select |#memory_int| |main_~#main__a~0.base|) |main_~#main__a~0.offset|) main_~main__marker~0)) (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem2|) (<= 0 main_~main__pos~0))} assume #t~mem2 != ~main__marker~0;havoc #t~mem2;~main__i~0 := 1 + ~main__i~0; {499#(and (not (= (select (select |#memory_int| |main_~#main__a~0.base|) |main_~#main__a~0.offset|) main_~main__marker~0)) (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (<= 0 main_~main__pos~0) (exists ((v_main_~main__i~0_10 Int)) (and (not (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 v_main_~main__i~0_10) |main_~#main__a~0.offset|)))) (<= main_~main__i~0 (+ v_main_~main__i~0_10 1)) (<= v_main_~main__i~0_10 1))))} is VALID [2018-11-23 12:10:00,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {499#(and (not (= (select (select |#memory_int| |main_~#main__a~0.base|) |main_~#main__a~0.offset|) main_~main__marker~0)) (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (<= 0 main_~main__pos~0) (exists ((v_main_~main__i~0_10 Int)) (and (not (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 v_main_~main__i~0_10) |main_~#main__a~0.offset|)))) (<= main_~main__i~0 (+ v_main_~main__i~0_10 1)) (<= v_main_~main__i~0_10 1))))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {503#(and (not (= (select (select |#memory_int| |main_~#main__a~0.base|) |main_~#main__a~0.offset|) main_~main__marker~0)) (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem2|) (<= 0 main_~main__pos~0) (exists ((v_main_~main__i~0_10 Int)) (and (not (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 v_main_~main__i~0_10) |main_~#main__a~0.offset|)))) (<= main_~main__i~0 (+ v_main_~main__i~0_10 1)) (<= v_main_~main__i~0_10 1))))} is VALID [2018-11-23 12:10:00,270 INFO L273 TraceCheckUtils]: 13: Hoare triple {503#(and (not (= (select (select |#memory_int| |main_~#main__a~0.base|) |main_~#main__a~0.offset|) main_~main__marker~0)) (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (= (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 main_~main__i~0) |main_~#main__a~0.offset|)) |main_#t~mem2|) (<= 0 main_~main__pos~0) (exists ((v_main_~main__i~0_10 Int)) (and (not (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 v_main_~main__i~0_10) |main_~#main__a~0.offset|)))) (<= main_~main__i~0 (+ v_main_~main__i~0_10 1)) (<= v_main_~main__i~0_10 1))))} assume #t~mem2 != ~main__marker~0;havoc #t~mem2;~main__i~0 := 1 + ~main__i~0; {507#(and (exists ((v_main_~main__i~0_11 Int) (v_main_~main__i~0_10 Int)) (and (not (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 v_main_~main__i~0_11) |main_~#main__a~0.offset|)))) (not (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 v_main_~main__i~0_10) |main_~#main__a~0.offset|)))) (<= main_~main__i~0 (+ v_main_~main__i~0_11 1)) (<= v_main_~main__i~0_10 1) (<= v_main_~main__i~0_11 (+ v_main_~main__i~0_10 1)))) (not (= (select (select |#memory_int| |main_~#main__a~0.base|) |main_~#main__a~0.offset|) main_~main__marker~0)) (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (<= 0 main_~main__pos~0))} is VALID [2018-11-23 12:10:00,272 INFO L273 TraceCheckUtils]: 14: Hoare triple {507#(and (exists ((v_main_~main__i~0_11 Int) (v_main_~main__i~0_10 Int)) (and (not (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 v_main_~main__i~0_11) |main_~#main__a~0.offset|)))) (not (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ (* 4 v_main_~main__i~0_10) |main_~#main__a~0.offset|)))) (<= main_~main__i~0 (+ v_main_~main__i~0_11 1)) (<= v_main_~main__i~0_10 1) (<= v_main_~main__i~0_11 (+ v_main_~main__i~0_10 1)))) (not (= (select (select |#memory_int| |main_~#main__a~0.base|) |main_~#main__a~0.offset|) main_~main__marker~0)) (= main_~main__marker~0 (select (select |#memory_int| |main_~#main__a~0.base|) (+ |main_~#main__a~0.offset| (* 4 main_~main__pos~0)))) (<= 0 main_~main__pos~0))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {511#(or (and (<= main_~main__i~0 3) (<= main_~main__i~0 main_~main__pos~0) (<= 0 main_~main__pos~0) (not (= (* 4 main_~main__pos~0) 0)) (not (= (* 4 main_~main__i~0) (* 4 main_~main__pos~0))) (not (= |main_#t~mem2| main_~main__marker~0))) (and (<= main_~main__i~0 3) (<= main_~main__i~0 main_~main__pos~0) (= |main_#t~mem2| main_~main__marker~0) (not (= (* 4 main_~main__i~0) 0)) (not (= (* 4 main_~main__pos~0) 0)) (<= 0 main_~main__pos~0)))} is VALID [2018-11-23 12:10:00,273 INFO L273 TraceCheckUtils]: 15: Hoare triple {511#(or (and (<= main_~main__i~0 3) (<= main_~main__i~0 main_~main__pos~0) (<= 0 main_~main__pos~0) (not (= (* 4 main_~main__pos~0) 0)) (not (= (* 4 main_~main__i~0) (* 4 main_~main__pos~0))) (not (= |main_#t~mem2| main_~main__marker~0))) (and (<= main_~main__i~0 3) (<= main_~main__i~0 main_~main__pos~0) (= |main_#t~mem2| main_~main__marker~0) (not (= (* 4 main_~main__i~0) 0)) (not (= (* 4 main_~main__pos~0) 0)) (<= 0 main_~main__pos~0)))} assume #t~mem2 != ~main__marker~0;havoc #t~mem2;~main__i~0 := 1 + ~main__i~0; {515#(and (not (= (* 4 main_~main__i~0) (+ (* 4 main_~main__pos~0) 4))) (<= main_~main__i~0 (+ main_~main__pos~0 1)) (not (= (* 4 main_~main__pos~0) 0)) (<= 0 main_~main__pos~0) (<= main_~main__i~0 4))} is VALID [2018-11-23 12:10:00,274 INFO L273 TraceCheckUtils]: 16: Hoare triple {515#(and (not (= (* 4 main_~main__i~0) (+ (* 4 main_~main__pos~0) 4))) (<= main_~main__i~0 (+ main_~main__pos~0 1)) (not (= (* 4 main_~main__pos~0) 0)) (<= 0 main_~main__pos~0) (<= main_~main__i~0 4))} call #t~mem2 := read~int(~#main__a~0.base, ~#main__a~0.offset + 4 * ~main__i~0, 4); {515#(and (not (= (* 4 main_~main__i~0) (+ (* 4 main_~main__pos~0) 4))) (<= main_~main__i~0 (+ main_~main__pos~0 1)) (not (= (* 4 main_~main__pos~0) 0)) (<= 0 main_~main__pos~0) (<= main_~main__i~0 4))} is VALID [2018-11-23 12:10:00,275 INFO L273 TraceCheckUtils]: 17: Hoare triple {515#(and (not (= (* 4 main_~main__i~0) (+ (* 4 main_~main__pos~0) 4))) (<= main_~main__i~0 (+ main_~main__pos~0 1)) (not (= (* 4 main_~main__pos~0) 0)) (<= 0 main_~main__pos~0) (<= main_~main__i~0 4))} assume !(#t~mem2 != ~main__marker~0);havoc #t~mem2;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__i~0 <= ~main__pos~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {457#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-23 12:10:00,276 INFO L273 TraceCheckUtils]: 18: Hoare triple {457#(= main_~__VERIFIER_assert__cond~0 1)} assume 0 == ~__VERIFIER_assert__cond~0; {446#false} is VALID [2018-11-23 12:10:00,276 INFO L273 TraceCheckUtils]: 19: Hoare triple {446#false} assume !false; {446#false} is VALID [2018-11-23 12:10:00,279 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:10:00,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:10:00,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-11-23 12:10:00,299 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 20 [2018-11-23 12:10:00,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:10:00,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:10:00,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:00,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:10:00,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:10:00,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=395, Unknown=5, NotChecked=0, Total=506 [2018-11-23 12:10:00,355 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 23 states. [2018-11-23 12:10:02,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:02,201 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 12:10:02,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:10:02,201 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 20 [2018-11-23 12:10:02,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:10:02,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:10:02,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-23 12:10:02,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:10:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-23 12:10:02,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 25 transitions. [2018-11-23 12:10:02,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:10:02,253 INFO L225 Difference]: With dead ends: 24 [2018-11-23 12:10:02,253 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:10:02,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=304, Invalid=951, Unknown=5, NotChecked=0, Total=1260 [2018-11-23 12:10:02,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:10:02,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:10:02,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:10:02,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 12:10:02,257 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:10:02,257 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:10:02,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:02,257 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:10:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:10:02,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:02,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:02,258 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 12:10:02,258 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 12:10:02,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:10:02,258 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:10:02,259 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:10:02,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:02,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:10:02,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:10:02,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:10:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:10:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:10:02,260 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-11-23 12:10:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:10:02,260 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:10:02,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:10:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:10:02,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:10:02,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:10:02,436 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:10:02,437 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:10:02,437 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:10:02,437 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:10:02,437 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 12:10:02,437 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:10:02,437 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:10:02,437 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 42) no Hoare annotation was computed. [2018-11-23 12:10:02,438 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 7 55) the Hoare annotation is: true [2018-11-23 12:10:02,438 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 7 55) no Hoare annotation was computed. [2018-11-23 12:10:02,438 INFO L444 ceAbstractionStarter]: At program point L24(lines 17 45) the Hoare annotation is: (let ((.cse1 (* 4 main_~main__pos~0))) (let ((.cse0 (select |#memory_int| |main_~#main__a~0.base|)) (.cse2 (+ |main_~#main__a~0.offset| .cse1)) (.cse3 (= |main_~#main__a~0.offset| 0)) (.cse4 (< 0 (+ |main_~#main__a~0.offset| .cse1 1)))) (or (and (= main_~main__marker~0 (select .cse0 (+ .cse1 |main_~#main__a~0.offset|))) (not (= .cse2 0)) .cse3 .cse4 (< main_~main__i~0 (+ main_~main__pos~0 1))) (and (= main_~main__marker~0 (select .cse0 .cse2)) (= main_~main__i~0 0) .cse3 .cse4)))) [2018-11-23 12:10:02,438 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 44) no Hoare annotation was computed. [2018-11-23 12:10:02,438 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 49) no Hoare annotation was computed. [2018-11-23 12:10:02,438 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 54) no Hoare annotation was computed. [2018-11-23 12:10:02,438 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 7 55) no Hoare annotation was computed. [2018-11-23 12:10:02,439 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 35) no Hoare annotation was computed. [2018-11-23 12:10:02,439 INFO L448 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2018-11-23 12:10:02,441 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:10:02,441 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 12:10:02,441 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:10:02,441 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:10:02,441 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 12:10:02,441 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 12:10:02,442 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:10:02,442 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:10:02,442 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 12:10:02,442 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 12:10:02,442 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:10:02,442 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 12:10:02,442 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:10:02,443 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 12:10:02,443 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 12:10:02,443 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-23 12:10:02,443 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-23 12:10:02,443 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 12:10:02,443 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 12:10:02,443 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:10:02,451 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:10:02,453 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:10:02,456 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:10:02,457 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:10:02,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:10:02 BoogieIcfgContainer [2018-11-23 12:10:02,460 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:10:02,464 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:10:02,464 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:10:02,464 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:10:02,465 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:09:46" (3/4) ... [2018-11-23 12:10:02,469 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:10:02,476 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:10:02,477 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:10:02,486 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-23 12:10:02,486 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 12:10:02,486 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 12:10:02,542 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/array-examples/standard_sentinel_true-unreach-call.i.v+cfa-reducer.c-witness.graphml [2018-11-23 12:10:02,542 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:10:02,543 INFO L168 Benchmark]: Toolchain (without parser) took 17227.68 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 860.4 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -225.3 MB). Peak memory consumption was 635.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:10:02,544 INFO L168 Benchmark]: CDTParser took 0.25 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-23 12:10:02,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.83 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-23 12:10:02,545 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.63 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-23 12:10:02,545 INFO L168 Benchmark]: Boogie Preprocessor took 25.44 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-23 12:10:02,546 INFO L168 Benchmark]: RCFGBuilder took 596.45 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.1 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:10:02,546 INFO L168 Benchmark]: TraceAbstraction took 16134.29 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 131.1 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 522.4 MB). Peak memory consumption was 653.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:10:02,547 INFO L168 Benchmark]: Witness Printer took 78.56 ms. Allocated memory is still 2.4 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:10:02,552 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.25 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 357.83 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 Procedure Inliner took 27.63 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. * Boogie Preprocessor took 25.44 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 596.45 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.1 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16134.29 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 131.1 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 522.4 MB). Peak memory consumption was 653.5 MB. Max. memory is 7.1 GB. * Witness Printer took 78.56 ms. Allocated memory is still 2.4 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 35]: 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: 17]: Loop Invariant [2018-11-23 12:10:02,561 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:10:02,562 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:10:02,563 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 12:10:02,563 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((main__marker == unknown-#memory_int-unknown[main__a][4 * main__pos + main__a] && !(main__a + 4 * main__pos == 0)) && main__a == 0) && 0 < main__a + 4 * main__pos + 1) && main__i < main__pos + 1) || (((main__marker == unknown-#memory_int-unknown[main__a][main__a + 4 * main__pos] && main__i == 0) && main__a == 0) && 0 < main__a + 4 * main__pos + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 17 locations, 1 error locations. SAFE Result, 16.0s OverallTime, 4 OverallIterations, 5 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 42 SDtfs, 114 SDslu, 153 SDs, 0 SdLazy, 207 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=3, 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.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 67 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 283 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 105 ConstructedInterpolants, 3 QuantifiedInterpolants, 23663 SizeOfPredicates, 24 NumberOfNonLiveVariables, 257 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 2/56 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...