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-370d6ab [2018-11-14 16:59:26,517 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:59:26,519 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:59:26,531 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:59:26,532 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:59:26,533 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:59:26,534 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:59:26,536 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:59:26,538 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:59:26,539 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:59:26,540 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:59:26,540 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:59:26,541 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:59:26,545 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:59:26,546 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:59:26,553 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:59:26,554 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:59:26,555 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:59:26,557 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:59:26,559 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:59:26,560 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:59:26,561 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:59:26,563 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:59:26,564 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:59:26,564 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:59:26,565 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:59:26,566 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:59:26,566 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:59:26,567 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:59:26,568 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:59:26,569 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:59:26,569 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:59:26,570 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:59:26,570 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:59:26,571 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:59:26,572 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:59:26,572 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 16:59:26,593 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:59:26,593 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:59:26,594 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:59:26,594 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:59:26,595 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:59:26,595 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:59:26,595 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:59:26,596 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:59:26,596 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:59:26,596 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 16:59:26,596 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:59:26,596 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:59:26,597 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:59:26,597 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:59:26,597 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:59:26,597 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:59:26,597 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:59:26,598 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:59:26,598 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:59:26,598 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:59:26,598 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:59:26,598 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:59:26,599 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:59:26,599 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:59:26,599 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:59:26,599 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:59:26,599 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 16:59:26,600 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:59:26,600 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 16:59:26,600 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:59:26,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:59:26,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:59:26,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:59:26,674 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:59:26,674 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:59:26,675 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-14 16:59:26,736 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6826c9ed8/a3438c94b9df4e0688469530bf7f204a/FLAGe26bdfcbf [2018-11-14 16:59:27,221 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:59:27,223 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_sentinel_true-unreach-call.i.v+cfa-reducer.c [2018-11-14 16:59:27,231 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6826c9ed8/a3438c94b9df4e0688469530bf7f204a/FLAGe26bdfcbf [2018-11-14 16:59:27,253 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6826c9ed8/a3438c94b9df4e0688469530bf7f204a [2018-11-14 16:59:27,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:59:27,270 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:59:27,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:59:27,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:59:27,278 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:59:27,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:59:27" (1/1) ... [2018-11-14 16:59:27,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c7a8dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:59:27, skipping insertion in model container [2018-11-14 16:59:27,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:59:27" (1/1) ... [2018-11-14 16:59:27,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:59:27,325 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:59:27,541 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:59:27,550 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:59:27,582 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:59:27,615 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:59:27,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:59:27 WrapperNode [2018-11-14 16:59:27,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:59:27,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:59:27,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:59:27,617 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:59:27,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:59:27" (1/1) ... [2018-11-14 16:59:27,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:59:27" (1/1) ... [2018-11-14 16:59:27,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:59:27" (1/1) ... [2018-11-14 16:59:27,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:59:27" (1/1) ... [2018-11-14 16:59:27,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:59:27" (1/1) ... [2018-11-14 16:59:27,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:59:27" (1/1) ... [2018-11-14 16:59:27,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:59:27" (1/1) ... [2018-11-14 16:59:27,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:59:27,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:59:27,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:59:27,675 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:59:27,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:59:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:59:27,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:59:27,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:59:27,817 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:59:27,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:59:27,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:59:27,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:59:27,818 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:59:27,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:59:27,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 16:59:27,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 16:59:27,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:59:27,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:59:27,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:59:27,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 16:59:28,316 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:59:28,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:59:28 BoogieIcfgContainer [2018-11-14 16:59:28,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:59:28,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:59:28,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:59:28,322 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:59:28,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:59:27" (1/3) ... [2018-11-14 16:59:28,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d37323d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:59:28, skipping insertion in model container [2018-11-14 16:59:28,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:59:27" (2/3) ... [2018-11-14 16:59:28,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d37323d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:59:28, skipping insertion in model container [2018-11-14 16:59:28,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:59:28" (3/3) ... [2018-11-14 16:59:28,326 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_sentinel_true-unreach-call.i.v+cfa-reducer.c [2018-11-14 16:59:28,336 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:59:28,347 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:59:28,371 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:59:28,402 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:59:28,403 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:59:28,403 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:59:28,403 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:59:28,403 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:59:28,403 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:59:28,404 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:59:28,404 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:59:28,404 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:59:28,429 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-14 16:59:28,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 16:59:28,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:28,438 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:59:28,441 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:28,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:28,447 INFO L82 PathProgramCache]: Analyzing trace with hash -920288751, now seen corresponding path program 1 times [2018-11-14 16:59:28,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:28,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:28,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:28,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:59:28,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:28,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-14 16:59:28,873 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-14 16:59:28,874 INFO L273 TraceCheckUtils]: 2: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-14 16:59:28,874 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20#true} {20#true} #29#return; {20#true} is VALID [2018-11-14 16:59:28,875 INFO L256 TraceCheckUtils]: 4: Hoare triple {20#true} call #t~ret3 := main(); {20#true} is VALID [2018-11-14 16:59:28,875 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-14 16:59:28,876 INFO L273 TraceCheckUtils]: 6: Hoare triple {20#true} assume ~main__pos~0 >= 0; {22#(<= 0 main_~main__pos~0)} is VALID [2018-11-14 16:59:28,877 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 + ~main__pos~0 * 4, 4);~main__i~0 := 0; {23#(and (= main_~main__i~0 0) (<= 0 main_~main__pos~0))} is VALID [2018-11-14 16:59:28,890 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 + ~main__i~0 * 4, 4); {23#(and (= main_~main__i~0 0) (<= 0 main_~main__pos~0))} is VALID [2018-11-14 16:59:28,891 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-14 16:59:28,901 INFO L273 TraceCheckUtils]: 10: Hoare triple {24#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {21#false} is VALID [2018-11-14 16:59:28,901 INFO L273 TraceCheckUtils]: 11: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-14 16:59:28,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:59:28,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:59:28,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:59:28,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-14 16:59:28,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:28,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:59:29,034 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-14 16:59:29,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:59:29,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:59:29,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:59:29,049 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 5 states. [2018-11-14 16:59:29,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:29,439 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-14 16:59:29,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:59:29,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-14 16:59:29,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:29,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:59:29,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-14 16:59:29,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:59:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-14 16:59:29,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2018-11-14 16:59:29,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:59:29,753 INFO L225 Difference]: With dead ends: 30 [2018-11-14 16:59:29,753 INFO L226 Difference]: Without dead ends: 15 [2018-11-14 16:59:29,761 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-14 16:59:29,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-14 16:59:29,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-14 16:59:29,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:29,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-14 16:59:29,818 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 16:59:29,818 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 16:59:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:29,821 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-14 16:59:29,821 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 16:59:29,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:29,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:29,822 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 16:59:29,823 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 16:59:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:29,826 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-14 16:59:29,826 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 16:59:29,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:29,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:29,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:29,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:59:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-14 16:59:29,831 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-14 16:59:29,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:29,832 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-14 16:59:29,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:59:29,832 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 16:59:29,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 16:59:29,833 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:29,833 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:59:29,834 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:29,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:29,834 INFO L82 PathProgramCache]: Analyzing trace with hash 363684724, now seen corresponding path program 1 times [2018-11-14 16:59:29,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:29,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:29,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:29,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:59:29,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:30,593 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 24 [2018-11-14 16:59:31,086 INFO L256 TraceCheckUtils]: 0: Hoare triple {116#true} call ULTIMATE.init(); {116#true} is VALID [2018-11-14 16:59:31,087 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-14 16:59:31,087 INFO L273 TraceCheckUtils]: 2: Hoare triple {116#true} assume true; {116#true} is VALID [2018-11-14 16:59:31,087 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {116#true} {116#true} #29#return; {116#true} is VALID [2018-11-14 16:59:31,088 INFO L256 TraceCheckUtils]: 4: Hoare triple {116#true} call #t~ret3 := main(); {116#true} is VALID [2018-11-14 16:59:31,101 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-14 16:59:31,114 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-14 16:59:31,121 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 + ~main__pos~0 * 4, 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-14 16:59:31,123 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 + ~main__i~0 * 4, 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-14 16:59:31,128 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 := ~main__i~0 + 1; {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-14 16:59:31,129 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 + ~main__i~0 * 4, 4); {123#(<= main_~main__i~0 main_~main__pos~0)} is VALID [2018-11-14 16:59:31,130 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-14 16:59:31,130 INFO L273 TraceCheckUtils]: 12: Hoare triple {124#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {117#false} is VALID [2018-11-14 16:59:31,131 INFO L273 TraceCheckUtils]: 13: Hoare triple {117#false} assume !false; {117#false} is VALID [2018-11-14 16:59:31,134 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-14 16:59:31,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:31,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 16:59:31,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:59:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:31,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:31,458 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-14 16:59:31,506 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-14 16:59:31,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:59:31,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:59:31,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:59:31,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-14 16:59:31,848 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-14 16:59:31,914 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-14 16:59:31,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-14 16:59:31,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:59:31,953 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-14 16:59:31,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:30 [2018-11-14 16:59:31,958 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:59:32,146 INFO L256 TraceCheckUtils]: 0: Hoare triple {116#true} call ULTIMATE.init(); {116#true} is VALID [2018-11-14 16:59:32,147 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-14 16:59:32,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {116#true} assume true; {116#true} is VALID [2018-11-14 16:59:32,147 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {116#true} {116#true} #29#return; {116#true} is VALID [2018-11-14 16:59:32,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {116#true} call #t~ret3 := main(); {116#true} is VALID [2018-11-14 16:59:32,148 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-14 16:59:32,148 INFO L273 TraceCheckUtils]: 6: Hoare triple {116#true} assume ~main__pos~0 >= 0; {146#(<= 0 main_~main__pos~0)} is VALID [2018-11-14 16:59:32,149 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 + ~main__pos~0 * 4, 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-14 16:59:32,151 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 + ~main__i~0 * 4, 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-14 16:59:32,168 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 := ~main__i~0 + 1; {158#(and (<= main_~main__i~0 main_~main__pos~0) (<= main_~main__i~0 1) (<= 0 main_~main__pos~0))} is VALID [2018-11-14 16:59:32,170 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 + ~main__i~0 * 4, 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-14 16:59:32,171 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-14 16:59:32,173 INFO L273 TraceCheckUtils]: 12: Hoare triple {124#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {117#false} is VALID [2018-11-14 16:59:32,173 INFO L273 TraceCheckUtils]: 13: Hoare triple {117#false} assume !false; {117#false} is VALID [2018-11-14 16:59:32,175 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-14 16:59:32,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:32,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2018-11-14 16:59:32,198 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-11-14 16:59:32,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:32,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 16:59:32,292 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-14 16:59:32,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 16:59:32,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 16:59:32,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:59:32,293 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2018-11-14 16:59:32,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:32,793 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 16:59:32,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:59:32,793 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-11-14 16:59:32,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:59:32,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-14 16:59:32,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:59:32,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-14 16:59:32,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 20 transitions. [2018-11-14 16:59:32,858 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-14 16:59:32,859 INFO L225 Difference]: With dead ends: 20 [2018-11-14 16:59:32,860 INFO L226 Difference]: Without dead ends: 17 [2018-11-14 16:59:32,861 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:59:32,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-14 16:59:32,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-14 16:59:32,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:32,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-14 16:59:32,961 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-14 16:59:32,961 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-14 16:59:32,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:32,963 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-14 16:59:32,963 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-14 16:59:32,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:32,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:32,963 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-14 16:59:32,964 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-14 16:59:32,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:32,965 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-14 16:59:32,966 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-14 16:59:32,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:32,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:32,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:32,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:59:32,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-14 16:59:32,969 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-11-14 16:59:32,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:32,969 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-14 16:59:32,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 16:59:32,969 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-14 16:59:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 16:59:32,970 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:32,970 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:59:32,971 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:32,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:32,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1606580247, now seen corresponding path program 2 times [2018-11-14 16:59:32,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:32,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:32,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:32,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:59:32,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:33,531 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 27 [2018-11-14 16:59:33,793 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 30 [2018-11-14 16:59:34,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {261#true} call ULTIMATE.init(); {261#true} is VALID [2018-11-14 16:59:34,213 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-14 16:59:34,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {261#true} assume true; {261#true} is VALID [2018-11-14 16:59:34,214 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {261#true} {261#true} #29#return; {261#true} is VALID [2018-11-14 16:59:34,214 INFO L256 TraceCheckUtils]: 4: Hoare triple {261#true} call #t~ret3 := main(); {261#true} is VALID [2018-11-14 16:59:34,215 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-14 16:59:34,216 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-14 16:59:34,217 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 + ~main__pos~0 * 4, 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-14 16:59:34,218 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 + ~main__i~0 * 4, 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-14 16:59:34,229 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 := ~main__i~0 + 1; {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-14 16:59:34,231 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 + ~main__i~0 * 4, 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-14 16:59:34,235 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 := ~main__i~0 + 1; {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-14 16:59:34,236 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 + ~main__i~0 * 4, 4); {270#(<= main_~main__i~0 main_~main__pos~0)} is VALID [2018-11-14 16:59:34,237 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-14 16:59:34,238 INFO L273 TraceCheckUtils]: 14: Hoare triple {271#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {262#false} is VALID [2018-11-14 16:59:34,238 INFO L273 TraceCheckUtils]: 15: Hoare triple {262#false} assume !false; {262#false} is VALID [2018-11-14 16:59:34,240 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-14 16:59:34,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:34,241 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-14 16:59:34,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:59:34,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:59:34,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:59:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:34,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:34,367 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-14 16:59:34,373 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-14 16:59:34,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:59:34,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:59:34,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:59:34,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-14 16:59:34,542 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-14 16:59:34,571 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-14 16:59:34,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-14 16:59:34,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:59:34,632 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-14 16:59:34,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:58 [2018-11-14 16:59:34,637 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:59:35,109 INFO L256 TraceCheckUtils]: 0: Hoare triple {261#true} call ULTIMATE.init(); {261#true} is VALID [2018-11-14 16:59:35,110 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-14 16:59:35,110 INFO L273 TraceCheckUtils]: 2: Hoare triple {261#true} assume true; {261#true} is VALID [2018-11-14 16:59:35,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {261#true} {261#true} #29#return; {261#true} is VALID [2018-11-14 16:59:35,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {261#true} call #t~ret3 := main(); {261#true} is VALID [2018-11-14 16:59:35,111 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-14 16:59:35,113 INFO L273 TraceCheckUtils]: 6: Hoare triple {261#true} assume ~main__pos~0 >= 0; {293#(<= 0 main_~main__pos~0)} is VALID [2018-11-14 16:59:35,115 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 + ~main__pos~0 * 4, 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-14 16:59:35,116 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 + ~main__i~0 * 4, 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-14 16:59:35,117 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 := ~main__i~0 + 1; {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-14 16:59:35,119 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 + ~main__i~0 * 4, 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-14 16:59:35,120 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 := ~main__i~0 + 1; {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-14 16:59:35,121 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 + ~main__i~0 * 4, 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-14 16:59:35,123 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-14 16:59:35,124 INFO L273 TraceCheckUtils]: 14: Hoare triple {271#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {262#false} is VALID [2018-11-14 16:59:35,124 INFO L273 TraceCheckUtils]: 15: Hoare triple {262#false} assume !false; {262#false} is VALID [2018-11-14 16:59:35,126 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-14 16:59:35,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:35,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-11-14 16:59:35,149 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-11-14 16:59:35,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:35,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 16:59:35,189 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-14 16:59:35,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 16:59:35,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 16:59:35,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:59:35,190 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-11-14 16:59:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:36,295 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-14 16:59:36,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 16:59:36,296 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-11-14 16:59:36,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:36,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:59:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2018-11-14 16:59:36,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:59:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2018-11-14 16:59:36,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 26 transitions. [2018-11-14 16:59:36,346 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-14 16:59:36,348 INFO L225 Difference]: With dead ends: 25 [2018-11-14 16:59:36,348 INFO L226 Difference]: Without dead ends: 21 [2018-11-14 16:59:36,349 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-14 16:59:36,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-14 16:59:36,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-14 16:59:36,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:36,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-14 16:59:36,387 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 16:59:36,387 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 16:59:36,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:36,390 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 16:59:36,390 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 16:59:36,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:36,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:36,391 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-14 16:59:36,391 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-14 16:59:36,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:36,393 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 16:59:36,394 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 16:59:36,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:36,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:36,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:36,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:36,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:59:36,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-14 16:59:36,397 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-11-14 16:59:36,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:36,397 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-14 16:59:36,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 16:59:36,398 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-14 16:59:36,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 16:59:36,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:59:36,399 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:59:36,399 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:59:36,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:59:36,399 INFO L82 PathProgramCache]: Analyzing trace with hash -750191843, now seen corresponding path program 3 times [2018-11-14 16:59:36,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:59:36,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:59:36,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:36,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:59:36,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:59:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:37,289 WARN L179 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 33 [2018-11-14 16:59:38,215 INFO L256 TraceCheckUtils]: 0: Hoare triple {445#true} call ULTIMATE.init(); {445#true} is VALID [2018-11-14 16:59:38,215 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-14 16:59:38,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {445#true} assume true; {445#true} is VALID [2018-11-14 16:59:38,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {445#true} {445#true} #29#return; {445#true} is VALID [2018-11-14 16:59:38,217 INFO L256 TraceCheckUtils]: 4: Hoare triple {445#true} call #t~ret3 := main(); {445#true} is VALID [2018-11-14 16:59:38,218 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-14 16:59:38,219 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-14 16:59:38,219 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 + ~main__pos~0 * 4, 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-14 16:59:38,220 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 + ~main__i~0 * 4, 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-14 16:59:38,222 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 := ~main__i~0 + 1; {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-14 16:59:38,224 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 + ~main__i~0 * 4, 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-14 16:59:38,243 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 := ~main__i~0 + 1; {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-14 16:59:38,258 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 + ~main__i~0 * 4, 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-14 16:59:38,274 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 := ~main__i~0 + 1; {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-14 16:59:38,285 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 + ~main__i~0 * 4, 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-14 16:59:38,286 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 := ~main__i~0 + 1; {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-14 16:59:38,286 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 + ~main__i~0 * 4, 4); {456#(<= main_~main__i~0 main_~main__pos~0)} is VALID [2018-11-14 16:59:38,287 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-14 16:59:38,287 INFO L273 TraceCheckUtils]: 18: Hoare triple {457#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {446#false} is VALID [2018-11-14 16:59:38,288 INFO L273 TraceCheckUtils]: 19: Hoare triple {446#false} assume !false; {446#false} is VALID [2018-11-14 16:59:38,291 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-14 16:59:38,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:59:38,291 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-14 16:59:38,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:59:38,351 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 16:59:38,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:59:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:59:38,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:59:38,433 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-14 16:59:38,450 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-14 16:59:38,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:59:38,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:59:38,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:59:38,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-14 16:59:40,939 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-14 16:59:41,013 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-14 16:59:41,014 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-14 16:59:41,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 72 xjuncts. [2018-11-14 16:59:41,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:59:41,997 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-14 16:59:41,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:71, output treesize:417 [2018-11-14 16:59:42,003 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:59:42,386 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 25 [2018-11-14 16:59:42,517 INFO L256 TraceCheckUtils]: 0: Hoare triple {445#true} call ULTIMATE.init(); {445#true} is VALID [2018-11-14 16:59:42,520 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-14 16:59:42,521 INFO L273 TraceCheckUtils]: 2: Hoare triple {445#true} assume true; {445#true} is VALID [2018-11-14 16:59:42,521 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {445#true} {445#true} #29#return; {445#true} is VALID [2018-11-14 16:59:42,521 INFO L256 TraceCheckUtils]: 4: Hoare triple {445#true} call #t~ret3 := main(); {445#true} is VALID [2018-11-14 16:59:42,522 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-14 16:59:42,522 INFO L273 TraceCheckUtils]: 6: Hoare triple {445#true} assume ~main__pos~0 >= 0; {479#(<= 0 main_~main__pos~0)} is VALID [2018-11-14 16:59:42,523 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 + ~main__pos~0 * 4, 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-14 16:59:42,524 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 + ~main__i~0 * 4, 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-14 16:59:42,524 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 := ~main__i~0 + 1; {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-14 16:59:42,525 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 + ~main__i~0 * 4, 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-14 16:59:42,528 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 := ~main__i~0 + 1; {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-14 16:59:42,529 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 + ~main__i~0 * 4, 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-14 16:59:42,535 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 := ~main__i~0 + 1; {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-14 16:59:42,537 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 + ~main__i~0 * 4, 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-14 16:59:42,538 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 := ~main__i~0 + 1; {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-14 16:59:42,540 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 + ~main__i~0 * 4, 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-14 16:59:42,541 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-14 16:59:42,542 INFO L273 TraceCheckUtils]: 18: Hoare triple {457#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {446#false} is VALID [2018-11-14 16:59:42,542 INFO L273 TraceCheckUtils]: 19: Hoare triple {446#false} assume !false; {446#false} is VALID [2018-11-14 16:59:42,546 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-14 16:59:42,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:59:42,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-11-14 16:59:42,566 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 20 [2018-11-14 16:59:42,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:59:42,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 16:59:42,624 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-14 16:59:42,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 16:59:42,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 16:59:42,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=395, Unknown=5, NotChecked=0, Total=506 [2018-11-14 16:59:42,625 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 23 states. [2018-11-14 16:59:43,720 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2018-11-14 16:59:44,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:44,437 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-14 16:59:44,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 16:59:44,438 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 20 [2018-11-14 16:59:44,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:59:44,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 16:59:44,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-14 16:59:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 16:59:44,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-14 16:59:44,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 25 transitions. [2018-11-14 16:59:44,486 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-14 16:59:44,486 INFO L225 Difference]: With dead ends: 24 [2018-11-14 16:59:44,487 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 16:59:44,488 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-14 16:59:44,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 16:59:44,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 16:59:44,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:59:44,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 16:59:44,489 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:59:44,489 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:59:44,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:44,490 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:59:44,490 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:59:44,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:44,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:44,490 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:59:44,490 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:59:44,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:59:44,490 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:59:44,491 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:59:44,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:44,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:59:44,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:59:44,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:59:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 16:59:44,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 16:59:44,492 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-11-14 16:59:44,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:59:44,492 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 16:59:44,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 16:59:44,492 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:59:44,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:59:44,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 16:59:44,670 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 16:59:44,670 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 16:59:44,671 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:59:44,671 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:59:44,671 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 16:59:44,671 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 16:59:44,671 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 16:59:44,671 INFO L425 ceAbstractionStarter]: For program point L33(lines 33 42) no Hoare annotation was computed. [2018-11-14 16:59:44,671 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 7 55) the Hoare annotation is: true [2018-11-14 16:59:44,671 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 7 55) no Hoare annotation was computed. [2018-11-14 16:59:44,672 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-14 16:59:44,672 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 35) no Hoare annotation was computed. [2018-11-14 16:59:44,672 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 44) no Hoare annotation was computed. [2018-11-14 16:59:44,672 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 49) no Hoare annotation was computed. [2018-11-14 16:59:44,672 INFO L425 ceAbstractionStarter]: For program point L14(lines 14 54) no Hoare annotation was computed. [2018-11-14 16:59:44,672 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 7 55) no Hoare annotation was computed. [2018-11-14 16:59:44,672 INFO L425 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2018-11-14 16:59:44,674 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 16:59:44,674 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 16:59:44,674 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 16:59:44,674 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:59:44,675 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 16:59:44,675 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 16:59:44,675 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:59:44,675 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:59:44,675 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-14 16:59:44,675 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-14 16:59:44,675 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:59:44,676 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 16:59:44,676 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 16:59:44,676 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 16:59:44,676 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-14 16:59:44,676 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-14 16:59:44,676 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2018-11-14 16:59:44,676 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-14 16:59:44,676 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-14 16:59:44,676 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-14 16:59:44,684 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 16:59:44,685 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 16:59:44,689 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 16:59:44,689 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 16:59:44,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:59:44 BoogieIcfgContainer [2018-11-14 16:59:44,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 16:59:44,694 INFO L168 Benchmark]: Toolchain (without parser) took 17425.20 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 863.0 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -242.7 MB). Peak memory consumption was 620.3 MB. Max. memory is 7.1 GB. [2018-11-14 16:59:44,695 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:59:44,695 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.00 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 16:59:44,696 INFO L168 Benchmark]: Boogie Preprocessor took 57.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:59:44,697 INFO L168 Benchmark]: RCFGBuilder took 642.73 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -740.5 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2018-11-14 16:59:44,698 INFO L168 Benchmark]: TraceAbstraction took 16374.65 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 154.1 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 487.2 MB). Peak memory consumption was 641.4 MB. Max. memory is 7.1 GB. [2018-11-14 16:59:44,702 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.22 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. * CACSL2BoogieTranslator took 345.00 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 57.41 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 642.73 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 708.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -740.5 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16374.65 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 154.1 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 487.2 MB). Peak memory consumption was 641.4 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-14 16:59:44,711 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 16:59:44,712 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 16:59:44,713 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-14 16:59:44,713 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.2s OverallTime, 4 OverallIterations, 5 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 42 SDtfs, 114 SDslu, 153 SDs, 0 SdLazy, 207 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 67 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 283 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 10.7s 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...