java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_sentinel_true-unreach-call.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:01:05,174 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:01:05,176 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:01:05,194 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:01:05,194 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:01:05,195 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:01:05,197 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:01:05,200 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:01:05,203 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:01:05,205 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:01:05,206 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:01:05,206 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:01:05,209 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:01:05,212 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:01:05,214 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:01:05,214 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:01:05,215 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:01:05,226 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:01:05,230 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:01:05,232 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:01:05,234 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:01:05,236 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:01:05,240 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:01:05,240 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:01:05,240 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:01:05,241 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:01:05,242 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:01:05,243 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:01:05,244 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:01:05,245 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:01:05,245 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:01:05,246 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:01:05,246 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:01:05,246 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:01:05,247 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:01:05,249 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:01:05,250 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-18 23:01:05,275 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:01:05,275 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:01:05,277 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:01:05,277 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:01:05,277 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:01:05,278 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:01:05,278 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:01:05,278 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:01:05,278 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:01:05,278 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:01:05,279 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:01:05,280 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:01:05,280 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:01:05,280 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:01:05,280 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:01:05,281 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:01:05,281 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:01:05,281 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:01:05,281 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:01:05,281 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:01:05,282 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:01:05,283 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:01:05,283 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:01:05,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:01:05,283 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:01:05,284 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:01:05,284 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:01:05,284 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:01:05,284 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:01:05,284 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:01:05,285 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:01:05,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:01:05,354 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:01:05,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:01:05,361 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:01:05,361 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:01:05,362 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-18 23:01:05,432 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0b58628d/1f9e362f89cf4a9fb6af417e1a4d260a/FLAG34e8bb843 [2018-11-18 23:01:05,889 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:01:05,889 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_sentinel_true-unreach-call.i.v+cfa-reducer.c [2018-11-18 23:01:05,895 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0b58628d/1f9e362f89cf4a9fb6af417e1a4d260a/FLAG34e8bb843 [2018-11-18 23:01:06,259 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0b58628d/1f9e362f89cf4a9fb6af417e1a4d260a [2018-11-18 23:01:06,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:01:06,270 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:01:06,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:01:06,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:01:06,278 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:01:06,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:01:06" (1/1) ... [2018-11-18 23:01:06,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714c28c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:06, skipping insertion in model container [2018-11-18 23:01:06,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:01:06" (1/1) ... [2018-11-18 23:01:06,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:01:06,325 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:01:06,577 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:01:06,583 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:01:06,610 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:01:06,637 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:01:06,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:06 WrapperNode [2018-11-18 23:01:06,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:01:06,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:01:06,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:01:06,639 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:01:06,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:06" (1/1) ... [2018-11-18 23:01:06,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:06" (1/1) ... [2018-11-18 23:01:06,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:06" (1/1) ... [2018-11-18 23:01:06,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:06" (1/1) ... [2018-11-18 23:01:06,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:06" (1/1) ... [2018-11-18 23:01:06,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:06" (1/1) ... [2018-11-18 23:01:06,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:06" (1/1) ... [2018-11-18 23:01:06,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:01:06,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:01:06,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:01:06,676 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:01:06,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:06" (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-18 23:01:06,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:01:06,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:01:06,824 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:01:06,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:01:06,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 23:01:06,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 23:01:06,824 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:01:06,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:01:06,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:01:06,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:01:06,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:01:06,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:01:06,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:01:06,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:01:07,312 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:01:07,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:01:07 BoogieIcfgContainer [2018-11-18 23:01:07,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:01:07,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:01:07,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:01:07,317 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:01:07,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:01:06" (1/3) ... [2018-11-18 23:01:07,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45707c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:01:07, skipping insertion in model container [2018-11-18 23:01:07,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:01:06" (2/3) ... [2018-11-18 23:01:07,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45707c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:01:07, skipping insertion in model container [2018-11-18 23:01:07,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:01:07" (3/3) ... [2018-11-18 23:01:07,321 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_sentinel_true-unreach-call.i.v+cfa-reducer.c [2018-11-18 23:01:07,331 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:01:07,339 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:01:07,355 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:01:07,388 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:01:07,389 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:01:07,389 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:01:07,389 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:01:07,389 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:01:07,389 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:01:07,390 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:01:07,390 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:01:07,390 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:01:07,414 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-18 23:01:07,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 23:01:07,420 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:01:07,421 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:01:07,423 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:01:07,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:01:07,431 INFO L82 PathProgramCache]: Analyzing trace with hash -920288751, now seen corresponding path program 1 times [2018-11-18 23:01:07,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:01:07,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:01:07,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:07,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:07,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:07,836 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-18 23:01:07,840 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-18 23:01:07,841 INFO L273 TraceCheckUtils]: 2: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-18 23:01:07,841 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20#true} {20#true} #29#return; {20#true} is VALID [2018-11-18 23:01:07,841 INFO L256 TraceCheckUtils]: 4: Hoare triple {20#true} call #t~ret3 := main(); {20#true} is VALID [2018-11-18 23:01:07,842 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-18 23:01:07,843 INFO L273 TraceCheckUtils]: 6: Hoare triple {20#true} assume ~main__pos~0 >= 0; {22#(<= 0 main_~main__pos~0)} is VALID [2018-11-18 23:01:07,844 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-18 23:01:07,853 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-18 23:01:07,856 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-18 23:01:07,873 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-18 23:01:07,873 INFO L273 TraceCheckUtils]: 11: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-18 23:01:07,876 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-18 23:01:07,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:01:07,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 23:01:07,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-18 23:01:07,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:01:07,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:01:07,994 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-18 23:01:07,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:01:08,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:01:08,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:01:08,009 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-11-18 23:01:08,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:08,387 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-18 23:01:08,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:01:08,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-18 23:01:08,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:01:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:01:08,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-18 23:01:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:01:08,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-18 23:01:08,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2018-11-18 23:01:08,645 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-18 23:01:08,660 INFO L225 Difference]: With dead ends: 30 [2018-11-18 23:01:08,662 INFO L226 Difference]: Without dead ends: 15 [2018-11-18 23:01:08,666 INFO L604 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-18 23:01:08,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-18 23:01:08,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-18 23:01:08,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:01:08,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-18 23:01:08,821 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-18 23:01:08,821 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-18 23:01:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:08,825 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-18 23:01:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-18 23:01:08,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:08,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:08,826 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-18 23:01:08,826 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-18 23:01:08,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:08,830 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-18 23:01:08,830 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-18 23:01:08,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:08,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:08,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:01:08,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:01:08,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 23:01:08,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-18 23:01:08,835 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-18 23:01:08,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:01:08,836 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-18 23:01:08,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:01:08,836 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-18 23:01:08,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 23:01:08,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:01:08,837 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:01:08,838 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:01:08,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:01:08,838 INFO L82 PathProgramCache]: Analyzing trace with hash 363684724, now seen corresponding path program 1 times [2018-11-18 23:01:08,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:01:08,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:01:08,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:08,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:08,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:09,664 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 24 [2018-11-18 23:01:10,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {116#true} call ULTIMATE.init(); {116#true} is VALID [2018-11-18 23:01:10,113 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-18 23:01:10,113 INFO L273 TraceCheckUtils]: 2: Hoare triple {116#true} assume true; {116#true} is VALID [2018-11-18 23:01:10,114 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {116#true} {116#true} #29#return; {116#true} is VALID [2018-11-18 23:01:10,114 INFO L256 TraceCheckUtils]: 4: Hoare triple {116#true} call #t~ret3 := main(); {116#true} is VALID [2018-11-18 23:01:10,134 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-18 23:01:10,144 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-18 23:01:10,146 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-18 23:01:10,149 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-18 23:01:10,150 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-18 23:01:10,151 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-18 23:01:10,152 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-18 23:01:10,153 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-18 23:01:10,153 INFO L273 TraceCheckUtils]: 13: Hoare triple {117#false} assume !false; {117#false} is VALID [2018-11-18 23:01:10,157 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-18 23:01:10,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:01:10,157 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-18 23:01:10,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:10,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:01:10,351 INFO L477 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-18 23:01:10,369 INFO L477 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-18 23:01:10,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:01:10,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:01:10,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:01:10,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-18 23:01:10,586 INFO L477 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-18 23:01:10,636 INFO L477 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-18 23:01:10,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 23:01:10,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 23:01:10,700 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-18 23:01:10,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:30 [2018-11-18 23:01:10,705 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:01:10,876 INFO L256 TraceCheckUtils]: 0: Hoare triple {116#true} call ULTIMATE.init(); {116#true} is VALID [2018-11-18 23:01:10,876 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-18 23:01:10,877 INFO L273 TraceCheckUtils]: 2: Hoare triple {116#true} assume true; {116#true} is VALID [2018-11-18 23:01:10,877 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {116#true} {116#true} #29#return; {116#true} is VALID [2018-11-18 23:01:10,877 INFO L256 TraceCheckUtils]: 4: Hoare triple {116#true} call #t~ret3 := main(); {116#true} is VALID [2018-11-18 23:01:10,878 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-18 23:01:10,878 INFO L273 TraceCheckUtils]: 6: Hoare triple {116#true} assume ~main__pos~0 >= 0; {146#(<= 0 main_~main__pos~0)} is VALID [2018-11-18 23:01:10,879 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-18 23:01:10,880 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-18 23:01:10,881 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-18 23:01:10,884 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-18 23:01:10,885 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-18 23:01:10,886 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-18 23:01:10,886 INFO L273 TraceCheckUtils]: 13: Hoare triple {117#false} assume !false; {117#false} is VALID [2018-11-18 23:01:10,888 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-18 23:01:10,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:01:10,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2018-11-18 23:01:10,910 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-11-18 23:01:10,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:01:10,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 23:01:11,009 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-18 23:01:11,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 23:01:11,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 23:01:11,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-18 23:01:11,011 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2018-11-18 23:01:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:11,558 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-18 23:01:11,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 23:01:11,558 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-11-18 23:01:11,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:01:11,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:01:11,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-18 23:01:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:01:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-18 23:01:11,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 20 transitions. [2018-11-18 23:01:11,670 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-18 23:01:11,671 INFO L225 Difference]: With dead ends: 20 [2018-11-18 23:01:11,671 INFO L226 Difference]: Without dead ends: 17 [2018-11-18 23:01:11,672 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-11-18 23:01:11,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-18 23:01:11,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-18 23:01:11,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:01:11,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-18 23:01:11,701 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-18 23:01:11,701 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-18 23:01:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:11,703 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-18 23:01:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-18 23:01:11,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:11,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:11,703 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-18 23:01:11,703 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-18 23:01:11,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:11,705 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-18 23:01:11,705 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-18 23:01:11,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:11,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:11,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:01:11,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:01:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 23:01:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-18 23:01:11,708 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-11-18 23:01:11,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:01:11,709 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-18 23:01:11,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 23:01:11,709 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-18 23:01:11,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 23:01:11,710 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:01:11,710 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:01:11,710 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:01:11,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:01:11,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1606580247, now seen corresponding path program 2 times [2018-11-18 23:01:11,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:01:11,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:01:11,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:11,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:01:11,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:12,254 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 27 [2018-11-18 23:01:12,468 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 30 [2018-11-18 23:01:12,900 INFO L256 TraceCheckUtils]: 0: Hoare triple {261#true} call ULTIMATE.init(); {261#true} is VALID [2018-11-18 23:01:12,901 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-18 23:01:12,902 INFO L273 TraceCheckUtils]: 2: Hoare triple {261#true} assume true; {261#true} is VALID [2018-11-18 23:01:12,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {261#true} {261#true} #29#return; {261#true} is VALID [2018-11-18 23:01:12,903 INFO L256 TraceCheckUtils]: 4: Hoare triple {261#true} call #t~ret3 := main(); {261#true} is VALID [2018-11-18 23:01:12,908 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-18 23:01:12,909 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-18 23:01:12,910 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-18 23:01:12,911 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-18 23:01:12,923 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-18 23:01:12,924 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-18 23:01:12,929 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-18 23:01:12,929 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-18 23:01:12,931 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-18 23:01:12,932 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-18 23:01:12,932 INFO L273 TraceCheckUtils]: 15: Hoare triple {262#false} assume !false; {262#false} is VALID [2018-11-18 23:01:12,933 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-18 23:01:12,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:01:12,934 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-18 23:01:12,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:01:12,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:01:12,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:01:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:13,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:01:13,067 INFO L477 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-18 23:01:13,076 INFO L477 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-18 23:01:13,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:01:13,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:01:13,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:01:13,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-18 23:01:13,255 INFO L477 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-18 23:01:13,293 INFO L477 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-18 23:01:13,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-18 23:01:13,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 23:01:13,363 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-18 23:01:13,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:58 [2018-11-18 23:01:13,368 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:01:13,832 INFO L256 TraceCheckUtils]: 0: Hoare triple {261#true} call ULTIMATE.init(); {261#true} is VALID [2018-11-18 23:01:13,833 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-18 23:01:13,833 INFO L273 TraceCheckUtils]: 2: Hoare triple {261#true} assume true; {261#true} is VALID [2018-11-18 23:01:13,833 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {261#true} {261#true} #29#return; {261#true} is VALID [2018-11-18 23:01:13,834 INFO L256 TraceCheckUtils]: 4: Hoare triple {261#true} call #t~ret3 := main(); {261#true} is VALID [2018-11-18 23:01:13,834 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-18 23:01:13,836 INFO L273 TraceCheckUtils]: 6: Hoare triple {261#true} assume ~main__pos~0 >= 0; {293#(<= 0 main_~main__pos~0)} is VALID [2018-11-18 23:01:13,837 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-18 23:01:13,838 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-18 23:01:13,840 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-18 23:01:13,841 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-18 23:01:13,843 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-18 23:01:13,844 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-18 23:01:13,845 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-18 23:01:13,846 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-18 23:01:13,846 INFO L273 TraceCheckUtils]: 15: Hoare triple {262#false} assume !false; {262#false} is VALID [2018-11-18 23:01:13,848 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-18 23:01:13,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:01:13,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-11-18 23:01:13,871 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-11-18 23:01:13,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:01:13,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 23:01:13,918 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-18 23:01:13,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 23:01:13,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 23:01:13,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-11-18 23:01:13,919 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-11-18 23:01:15,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:15,028 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-18 23:01:15,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 23:01:15,028 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-11-18 23:01:15,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:01:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 23:01:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2018-11-18 23:01:15,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 23:01:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2018-11-18 23:01:15,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 26 transitions. [2018-11-18 23:01:15,084 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-18 23:01:15,086 INFO L225 Difference]: With dead ends: 25 [2018-11-18 23:01:15,087 INFO L226 Difference]: Without dead ends: 21 [2018-11-18 23:01:15,088 INFO L604 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-18 23:01:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-18 23:01:15,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-18 23:01:15,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:01:15,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-18 23:01:15,126 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-18 23:01:15,126 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-18 23:01:15,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:15,129 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-18 23:01:15,129 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-18 23:01:15,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:15,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:15,130 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-18 23:01:15,130 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-18 23:01:15,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:15,132 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-18 23:01:15,132 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-18 23:01:15,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:15,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:15,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:01:15,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:01:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 23:01:15,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-18 23:01:15,135 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-11-18 23:01:15,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:01:15,135 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-18 23:01:15,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 23:01:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-18 23:01:15,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 23:01:15,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:01:15,137 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:01:15,137 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:01:15,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:01:15,137 INFO L82 PathProgramCache]: Analyzing trace with hash -750191843, now seen corresponding path program 3 times [2018-11-18 23:01:15,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:01:15,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:01:15,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:15,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:01:15,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:01:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:15,663 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 25 [2018-11-18 23:01:16,172 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 33 [2018-11-18 23:01:16,607 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 30 [2018-11-18 23:01:17,049 INFO L256 TraceCheckUtils]: 0: Hoare triple {445#true} call ULTIMATE.init(); {445#true} is VALID [2018-11-18 23:01:17,049 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-18 23:01:17,050 INFO L273 TraceCheckUtils]: 2: Hoare triple {445#true} assume true; {445#true} is VALID [2018-11-18 23:01:17,050 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {445#true} {445#true} #29#return; {445#true} is VALID [2018-11-18 23:01:17,050 INFO L256 TraceCheckUtils]: 4: Hoare triple {445#true} call #t~ret3 := main(); {445#true} is VALID [2018-11-18 23:01:17,052 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-18 23:01:17,052 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-18 23:01:17,053 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-18 23:01:17,054 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-18 23:01:17,056 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-18 23:01:17,058 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-18 23:01:17,079 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-18 23:01:17,096 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-18 23:01:17,106 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-18 23:01:17,117 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-18 23:01:17,118 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-18 23:01:17,119 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-18 23:01:17,120 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-18 23:01:17,121 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-18 23:01:17,121 INFO L273 TraceCheckUtils]: 19: Hoare triple {446#false} assume !false; {446#false} is VALID [2018-11-18 23:01:17,124 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-18 23:01:17,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:01:17,124 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-18 23:01:17,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:01:17,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 23:01:17,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:01:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:01:17,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:01:17,244 INFO L477 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-18 23:01:17,248 INFO L477 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-18 23:01:17,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:01:17,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:01:17,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:01:17,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-18 23:01:19,667 INFO L477 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-18 23:01:19,743 INFO L477 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-18 23:01:19,744 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-18 23:01:20,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 72 xjuncts. [2018-11-18 23:01:20,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 23:01:20,768 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-18 23:01:20,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:71, output treesize:417 [2018-11-18 23:01:20,776 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:01:21,136 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 25 [2018-11-18 23:01:21,247 INFO L256 TraceCheckUtils]: 0: Hoare triple {445#true} call ULTIMATE.init(); {445#true} is VALID [2018-11-18 23:01:21,247 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-18 23:01:21,248 INFO L273 TraceCheckUtils]: 2: Hoare triple {445#true} assume true; {445#true} is VALID [2018-11-18 23:01:21,248 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {445#true} {445#true} #29#return; {445#true} is VALID [2018-11-18 23:01:21,248 INFO L256 TraceCheckUtils]: 4: Hoare triple {445#true} call #t~ret3 := main(); {445#true} is VALID [2018-11-18 23:01:21,249 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-18 23:01:21,250 INFO L273 TraceCheckUtils]: 6: Hoare triple {445#true} assume ~main__pos~0 >= 0; {479#(<= 0 main_~main__pos~0)} is VALID [2018-11-18 23:01:21,251 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-18 23:01:21,252 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-18 23:01:21,253 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-18 23:01:21,254 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-18 23:01:21,257 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-18 23:01:21,258 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-18 23:01:21,265 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-18 23:01:21,267 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-18 23:01:21,269 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-18 23:01:21,270 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-18 23:01:21,271 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-18 23:01:21,272 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-18 23:01:21,272 INFO L273 TraceCheckUtils]: 19: Hoare triple {446#false} assume !false; {446#false} is VALID [2018-11-18 23:01:21,276 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-18 23:01:21,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:01:21,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-11-18 23:01:21,296 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 20 [2018-11-18 23:01:21,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:01:21,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-18 23:01:21,352 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-18 23:01:21,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 23:01:21,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 23:01:21,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=395, Unknown=5, NotChecked=0, Total=506 [2018-11-18 23:01:21,354 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 23 states. [2018-11-18 23:01:23,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:23,304 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-18 23:01:23,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 23:01:23,304 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 20 [2018-11-18 23:01:23,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:01:23,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 23:01:23,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-18 23:01:23,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 23:01:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-18 23:01:23,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 25 transitions. [2018-11-18 23:01:23,359 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-18 23:01:23,360 INFO L225 Difference]: With dead ends: 24 [2018-11-18 23:01:23,360 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 23:01:23,362 INFO L604 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-18 23:01:23,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 23:01:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 23:01:23,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:01:23,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 23:01:23,362 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 23:01:23,363 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 23:01:23,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:23,363 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 23:01:23,363 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:01:23,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:23,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:23,363 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 23:01:23,364 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 23:01:23,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:01:23,364 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 23:01:23,364 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:01:23,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:23,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:01:23,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:01:23,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:01:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 23:01:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 23:01:23,365 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-11-18 23:01:23,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:01:23,365 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 23:01:23,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 23:01:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:01:23,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:01:23,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 23:01:23,551 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 23:01:23,552 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 23:01:23,552 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 23:01:23,552 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 23:01:23,552 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 23:01:23,552 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 23:01:23,552 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 23:01:23,552 INFO L425 ceAbstractionStarter]: For program point L33(lines 33 42) no Hoare annotation was computed. [2018-11-18 23:01:23,553 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 7 55) the Hoare annotation is: true [2018-11-18 23:01:23,553 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 7 55) no Hoare annotation was computed. [2018-11-18 23:01:23,553 INFO L421 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-18 23:01:23,553 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 44) no Hoare annotation was computed. [2018-11-18 23:01:23,553 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 49) no Hoare annotation was computed. [2018-11-18 23:01:23,553 INFO L425 ceAbstractionStarter]: For program point L14(lines 14 54) no Hoare annotation was computed. [2018-11-18 23:01:23,554 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 7 55) no Hoare annotation was computed. [2018-11-18 23:01:23,554 INFO L425 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2018-11-18 23:01:23,554 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 35) no Hoare annotation was computed. [2018-11-18 23:01:23,555 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 23:01:23,556 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-18 23:01:23,556 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 23:01:23,556 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:01:23,556 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-18 23:01:23,556 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-18 23:01:23,556 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 23:01:23,556 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:01:23,556 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-18 23:01:23,557 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-18 23:01:23,557 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 23:01:23,557 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-18 23:01:23,557 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 23:01:23,557 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-18 23:01:23,557 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-18 23:01:23,557 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-18 23:01:23,558 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-18 23:01:23,558 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-18 23:01:23,558 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-18 23:01:23,558 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-18 23:01:23,565 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 23:01:23,566 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 23:01:23,569 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 23:01:23,570 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 23:01:23,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:01:23 BoogieIcfgContainer [2018-11-18 23:01:23,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 23:01:23,574 INFO L168 Benchmark]: Toolchain (without parser) took 17305.06 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 857.7 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -221.7 MB). Peak memory consumption was 636.1 MB. Max. memory is 7.1 GB. [2018-11-18 23:01:23,575 INFO L168 Benchmark]: CDTParser took 0.23 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-18 23:01:23,576 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.34 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-18 23:01:23,576 INFO L168 Benchmark]: Boogie Preprocessor took 37.10 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-18 23:01:23,577 INFO L168 Benchmark]: RCFGBuilder took 637.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -747.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2018-11-18 23:01:23,578 INFO L168 Benchmark]: TraceAbstraction took 16259.45 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 137.4 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 515.3 MB). Peak memory consumption was 652.7 MB. Max. memory is 7.1 GB. [2018-11-18 23:01:23,582 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.23 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 367.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.10 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 637.13 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 720.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -747.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16259.45 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 137.4 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 515.3 MB). Peak memory consumption was 652.7 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-18 23:01:23,593 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 23:01:23,593 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 23:01:23,596 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 23:01:23,596 WARN L1239 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.1s OverallTime, 4 OverallIterations, 5 TraceHistogramMax, 4.5s 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.1s 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...