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_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:33:48,152 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:33:48,154 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:33:48,168 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:33:48,169 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:33:48,170 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:33:48,171 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:33:48,173 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:33:48,175 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:33:48,176 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:33:48,177 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:33:48,177 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:33:48,178 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:33:48,179 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:33:48,180 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:33:48,181 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:33:48,183 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:33:48,185 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:33:48,187 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:33:48,193 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:33:48,194 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:33:48,195 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:33:48,201 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:33:48,201 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:33:48,205 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:33:48,206 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:33:48,207 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:33:48,208 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:33:48,210 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:33:48,214 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:33:48,214 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:33:48,215 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:33:48,215 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:33:48,216 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:33:48,217 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:33:48,217 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:33:48,218 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 22:33:48,249 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:33:48,249 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:33:48,250 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:33:48,250 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:33:48,251 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:33:48,251 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:33:48,252 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:33:48,252 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:33:48,252 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:33:48,252 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:33:48,252 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:33:48,253 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:33:48,253 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:33:48,253 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:33:48,253 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 22:33:48,253 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 22:33:48,255 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:33:48,255 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:33:48,255 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:33:48,255 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:33:48,256 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:33:48,256 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:33:48,256 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:33:48,256 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:33:48,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:33:48,257 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:33:48,257 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:33:48,257 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:33:48,258 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 22:33:48,258 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:33:48,258 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 22:33:48,258 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 22:33:48,258 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:33:48,328 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:33:48,343 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:33:48,347 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:33:48,349 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:33:48,349 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:33:48,350 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.v+cfa-reducer.c [2018-11-18 22:33:48,418 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87c4da01/c65fdf8ad5cd40aa8246e448c077cb54/FLAG3ebaeaed0 [2018-11-18 22:33:48,892 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:33:48,893 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.v+cfa-reducer.c [2018-11-18 22:33:48,900 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87c4da01/c65fdf8ad5cd40aa8246e448c077cb54/FLAG3ebaeaed0 [2018-11-18 22:33:49,257 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87c4da01/c65fdf8ad5cd40aa8246e448c077cb54 [2018-11-18 22:33:49,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:33:49,270 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:33:49,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:33:49,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:33:49,276 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:33:49,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:33:49" (1/1) ... [2018-11-18 22:33:49,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff1c413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:49, skipping insertion in model container [2018-11-18 22:33:49,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:33:49" (1/1) ... [2018-11-18 22:33:49,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:33:49,321 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:33:49,506 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:33:49,513 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:33:49,536 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:33:49,550 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:33:49,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:49 WrapperNode [2018-11-18 22:33:49,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:33:49,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:33:49,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:33:49,552 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:33:49,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:49" (1/1) ... [2018-11-18 22:33:49,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:49" (1/1) ... [2018-11-18 22:33:49,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:49" (1/1) ... [2018-11-18 22:33:49,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:49" (1/1) ... [2018-11-18 22:33:49,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:49" (1/1) ... [2018-11-18 22:33:49,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:49" (1/1) ... [2018-11-18 22:33:49,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:49" (1/1) ... [2018-11-18 22:33:49,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:33:49,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:33:49,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:33:49,586 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:33:49,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:33:49,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:33:49,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:33:49,711 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:33:49,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:33:49,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 22:33:49,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:33:49,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 22:33:49,712 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:33:49,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:33:49,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:33:50,113 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:33:50,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:33:50 BoogieIcfgContainer [2018-11-18 22:33:50,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:33:50,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:33:50,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:33:50,119 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:33:50,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:33:49" (1/3) ... [2018-11-18 22:33:50,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f29eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:33:50, skipping insertion in model container [2018-11-18 22:33:50,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:33:49" (2/3) ... [2018-11-18 22:33:50,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f29eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:33:50, skipping insertion in model container [2018-11-18 22:33:50,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:33:50" (3/3) ... [2018-11-18 22:33:50,123 INFO L112 eAbstractionObserver]: Analyzing ICFG gauss_sum_true-unreach-call.i.v+cfa-reducer.c [2018-11-18 22:33:50,134 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:33:50,143 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:33:50,162 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:33:50,197 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:33:50,198 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:33:50,198 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:33:50,198 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:33:50,198 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:33:50,198 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:33:50,199 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:33:50,199 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:33:50,199 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:33:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-11-18 22:33:50,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 22:33:50,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:33:50,225 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:33:50,228 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:33:50,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:33:50,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1277702393, now seen corresponding path program 1 times [2018-11-18 22:33:50,239 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:33:50,240 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:33:50,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:33:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:33:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:33:50,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:33:50,484 INFO L256 TraceCheckUtils]: 0: Hoare triple {19#true} call ULTIMATE.init(); {19#true} is VALID [2018-11-18 22:33:50,487 INFO L273 TraceCheckUtils]: 1: Hoare triple {19#true} ~__return_main~0 := 0bv32;~__return_60~0 := 0bv32; {19#true} is VALID [2018-11-18 22:33:50,488 INFO L273 TraceCheckUtils]: 2: Hoare triple {19#true} assume true; {19#true} is VALID [2018-11-18 22:33:50,488 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} #28#return; {19#true} is VALID [2018-11-18 22:33:50,489 INFO L256 TraceCheckUtils]: 4: Hoare triple {19#true} call #t~ret2 := main(); {19#true} is VALID [2018-11-18 22:33:50,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {19#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {19#true} is VALID [2018-11-18 22:33:50,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {19#true} assume !!~bvsle32(1bv32, ~main__n~0); {42#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-18 22:33:50,494 INFO L273 TraceCheckUtils]: 7: Hoare triple {42#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {46#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-18 22:33:50,504 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {20#false} is VALID [2018-11-18 22:33:50,505 INFO L273 TraceCheckUtils]: 9: Hoare triple {20#false} assume 0bv32 == ~__VERIFIER_assert__cond~0; {20#false} is VALID [2018-11-18 22:33:50,505 INFO L273 TraceCheckUtils]: 10: Hoare triple {20#false} assume !false; {20#false} is VALID [2018-11-18 22:33:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:33:50,509 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 22:33:50,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:33:50,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 22:33:50,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-18 22:33:50,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:33:50,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 22:33:50,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:33:50,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 22:33:50,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 22:33:50,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 22:33:50,622 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2018-11-18 22:33:51,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:33:51,091 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-18 22:33:51,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:33:51,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-18 22:33:51,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:33:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:33:51,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-18 22:33:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 22:33:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-18 22:33:51,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2018-11-18 22:33:51,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:33:51,220 INFO L225 Difference]: With dead ends: 26 [2018-11-18 22:33:51,220 INFO L226 Difference]: Without dead ends: 13 [2018-11-18 22:33:51,223 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 22:33:51,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-18 22:33:51,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-18 22:33:51,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:33:51,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-18 22:33:51,280 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-18 22:33:51,280 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-18 22:33:51,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:33:51,283 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-18 22:33:51,283 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-18 22:33:51,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:33:51,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:33:51,284 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-18 22:33:51,284 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-18 22:33:51,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:33:51,287 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-18 22:33:51,287 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-18 22:33:51,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:33:51,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:33:51,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:33:51,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:33:51,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:33:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-18 22:33:51,292 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-18 22:33:51,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:33:51,292 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-18 22:33:51,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 22:33:51,292 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-18 22:33:51,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 22:33:51,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:33:51,293 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:33:51,294 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:33:51,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:33:51,294 INFO L82 PathProgramCache]: Analyzing trace with hash -954130992, now seen corresponding path program 1 times [2018-11-18 22:33:51,294 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:33:51,295 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:33:51,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:33:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:33:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:33:51,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:33:51,667 INFO L256 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {132#true} is VALID [2018-11-18 22:33:51,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {132#true} ~__return_main~0 := 0bv32;~__return_60~0 := 0bv32; {132#true} is VALID [2018-11-18 22:33:51,668 INFO L273 TraceCheckUtils]: 2: Hoare triple {132#true} assume true; {132#true} is VALID [2018-11-18 22:33:51,668 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} #28#return; {132#true} is VALID [2018-11-18 22:33:51,669 INFO L256 TraceCheckUtils]: 4: Hoare triple {132#true} call #t~ret2 := main(); {132#true} is VALID [2018-11-18 22:33:51,669 INFO L273 TraceCheckUtils]: 5: Hoare triple {132#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {132#true} is VALID [2018-11-18 22:33:51,669 INFO L273 TraceCheckUtils]: 6: Hoare triple {132#true} assume !!~bvsle32(1bv32, ~main__n~0); {155#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-18 22:33:51,671 INFO L273 TraceCheckUtils]: 7: Hoare triple {155#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {159#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-18 22:33:51,678 INFO L273 TraceCheckUtils]: 8: Hoare triple {159#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {163#(and (bvsle (_ bv1 32) main_~main__n~0) (= (bvadd main_~main__sum~0 (_ bv1 32)) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:33:51,687 INFO L273 TraceCheckUtils]: 9: Hoare triple {163#(and (bvsle (_ bv1 32) main_~main__n~0) (= (bvadd main_~main__sum~0 (_ bv1 32)) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {167#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:33:51,689 INFO L273 TraceCheckUtils]: 10: Hoare triple {167#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {133#false} is VALID [2018-11-18 22:33:51,689 INFO L273 TraceCheckUtils]: 11: Hoare triple {133#false} assume !false; {133#false} is VALID [2018-11-18 22:33:51,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:33:51,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:33:53,451 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-18 22:33:53,980 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-18 22:33:54,025 INFO L273 TraceCheckUtils]: 11: Hoare triple {133#false} assume !false; {133#false} is VALID [2018-11-18 22:33:54,026 INFO L273 TraceCheckUtils]: 10: Hoare triple {177#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {133#false} is VALID [2018-11-18 22:33:54,035 INFO L273 TraceCheckUtils]: 9: Hoare triple {181#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {177#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-18 22:33:54,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {185#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {181#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} is VALID [2018-11-18 22:33:54,079 INFO L273 TraceCheckUtils]: 7: Hoare triple {189#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (_ bv2 32)) (bvsle (_ bv2 32) main_~main__n~0))} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {185#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} is VALID [2018-11-18 22:33:54,089 INFO L273 TraceCheckUtils]: 6: Hoare triple {132#true} assume !!~bvsle32(1bv32, ~main__n~0); {189#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (_ bv2 32)) (bvsle (_ bv2 32) main_~main__n~0))} is VALID [2018-11-18 22:33:54,090 INFO L273 TraceCheckUtils]: 5: Hoare triple {132#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {132#true} is VALID [2018-11-18 22:33:54,090 INFO L256 TraceCheckUtils]: 4: Hoare triple {132#true} call #t~ret2 := main(); {132#true} is VALID [2018-11-18 22:33:54,090 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {132#true} {132#true} #28#return; {132#true} is VALID [2018-11-18 22:33:54,091 INFO L273 TraceCheckUtils]: 2: Hoare triple {132#true} assume true; {132#true} is VALID [2018-11-18 22:33:54,091 INFO L273 TraceCheckUtils]: 1: Hoare triple {132#true} ~__return_main~0 := 0bv32;~__return_60~0 := 0bv32; {132#true} is VALID [2018-11-18 22:33:54,092 INFO L256 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {132#true} is VALID [2018-11-18 22:33:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:33:54,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:33:54,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-18 22:33:54,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-11-18 22:33:54,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:33:54,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 22:33:54,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:33:54,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 22:33:54,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 22:33:54,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:33:54,222 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2018-11-18 22:33:55,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:33:55,489 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-18 22:33:55,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:33:55,490 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-11-18 22:33:55,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:33:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:33:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-18 22:33:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:33:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2018-11-18 22:33:55,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 20 transitions. [2018-11-18 22:33:55,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:33:55,554 INFO L225 Difference]: With dead ends: 19 [2018-11-18 22:33:55,554 INFO L226 Difference]: Without dead ends: 15 [2018-11-18 22:33:55,555 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:33:55,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-18 22:33:55,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-18 22:33:55,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:33:55,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-18 22:33:55,567 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-18 22:33:55,567 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-18 22:33:55,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:33:55,569 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-18 22:33:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-18 22:33:55,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:33:55,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:33:55,570 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-18 22:33:55,570 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-18 22:33:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:33:55,572 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-18 22:33:55,572 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-18 22:33:55,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:33:55,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:33:55,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:33:55,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:33:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:33:55,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-18 22:33:55,575 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-18 22:33:55,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:33:55,575 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-18 22:33:55,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 22:33:55,576 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-18 22:33:55,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 22:33:55,576 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:33:55,576 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:33:55,577 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:33:55,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:33:55,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2093848400, now seen corresponding path program 2 times [2018-11-18 22:33:55,577 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:33:55,578 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:33:55,594 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 22:33:55,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:33:55,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:33:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:33:55,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:33:56,154 INFO L256 TraceCheckUtils]: 0: Hoare triple {299#true} call ULTIMATE.init(); {299#true} is VALID [2018-11-18 22:33:56,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {299#true} ~__return_main~0 := 0bv32;~__return_60~0 := 0bv32; {299#true} is VALID [2018-11-18 22:33:56,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {299#true} assume true; {299#true} is VALID [2018-11-18 22:33:56,155 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {299#true} {299#true} #28#return; {299#true} is VALID [2018-11-18 22:33:56,156 INFO L256 TraceCheckUtils]: 4: Hoare triple {299#true} call #t~ret2 := main(); {299#true} is VALID [2018-11-18 22:33:56,156 INFO L273 TraceCheckUtils]: 5: Hoare triple {299#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {299#true} is VALID [2018-11-18 22:33:56,157 INFO L273 TraceCheckUtils]: 6: Hoare triple {299#true} assume !!~bvsle32(1bv32, ~main__n~0); {322#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-18 22:33:56,158 INFO L273 TraceCheckUtils]: 7: Hoare triple {322#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {326#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-18 22:33:56,161 INFO L273 TraceCheckUtils]: 8: Hoare triple {326#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {330#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv2 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:33:56,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {330#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv2 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {334#(and (= (_ bv3 32) main_~main__sum~0) (= (_ bv3 32) main_~main__i~0) (bvsle (_ bv2 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:33:56,166 INFO L273 TraceCheckUtils]: 10: Hoare triple {334#(and (= (_ bv3 32) main_~main__sum~0) (= (_ bv3 32) main_~main__i~0) (bvsle (_ bv2 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {338#(and (bvsle (_ bv3 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv4 32) main_~main__i~0) (= (_ bv6 32) main_~main__sum~0))} is VALID [2018-11-18 22:33:56,175 INFO L273 TraceCheckUtils]: 11: Hoare triple {338#(and (bvsle (_ bv3 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv4 32) main_~main__i~0) (= (_ bv6 32) main_~main__sum~0))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {342#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:33:56,176 INFO L273 TraceCheckUtils]: 12: Hoare triple {342#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {300#false} is VALID [2018-11-18 22:33:56,176 INFO L273 TraceCheckUtils]: 13: Hoare triple {300#false} assume !false; {300#false} is VALID [2018-11-18 22:33:56,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:33:56,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:33:59,652 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-18 22:34:02,183 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-18 22:34:02,338 INFO L273 TraceCheckUtils]: 13: Hoare triple {300#false} assume !false; {300#false} is VALID [2018-11-18 22:34:02,340 INFO L273 TraceCheckUtils]: 12: Hoare triple {352#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {300#false} is VALID [2018-11-18 22:34:02,348 INFO L273 TraceCheckUtils]: 11: Hoare triple {356#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {352#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-18 22:34:02,397 INFO L273 TraceCheckUtils]: 10: Hoare triple {360#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {356#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} is VALID [2018-11-18 22:34:04,402 INFO L273 TraceCheckUtils]: 9: Hoare triple {364#(or (not (bvsle main_~main__i~0 main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv4 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv2 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {360#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:34:06,409 INFO L273 TraceCheckUtils]: 8: Hoare triple {368#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv6 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv6 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {364#(or (not (bvsle main_~main__i~0 main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv4 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv2 32))))} is UNKNOWN [2018-11-18 22:34:06,418 INFO L273 TraceCheckUtils]: 7: Hoare triple {299#true} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {368#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv6 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv6 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0))} is VALID [2018-11-18 22:34:06,418 INFO L273 TraceCheckUtils]: 6: Hoare triple {299#true} assume !!~bvsle32(1bv32, ~main__n~0); {299#true} is VALID [2018-11-18 22:34:06,419 INFO L273 TraceCheckUtils]: 5: Hoare triple {299#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {299#true} is VALID [2018-11-18 22:34:06,419 INFO L256 TraceCheckUtils]: 4: Hoare triple {299#true} call #t~ret2 := main(); {299#true} is VALID [2018-11-18 22:34:06,419 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {299#true} {299#true} #28#return; {299#true} is VALID [2018-11-18 22:34:06,419 INFO L273 TraceCheckUtils]: 2: Hoare triple {299#true} assume true; {299#true} is VALID [2018-11-18 22:34:06,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {299#true} ~__return_main~0 := 0bv32;~__return_60~0 := 0bv32; {299#true} is VALID [2018-11-18 22:34:06,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {299#true} call ULTIMATE.init(); {299#true} is VALID [2018-11-18 22:34:06,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:34:06,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:34:06,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-18 22:34:06,425 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-11-18 22:34:06,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:34:06,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 22:34:10,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 19 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-18 22:34:10,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 22:34:10,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 22:34:10,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:34:10,565 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2018-11-18 22:34:12,691 WARN L180 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-11-18 22:34:13,545 WARN L180 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2018-11-18 22:34:14,776 WARN L180 SmtUtils]: Spent 903.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2018-11-18 22:34:15,215 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-18 22:34:17,102 WARN L180 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-11-18 22:34:17,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:34:17,315 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-18 22:34:17,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 22:34:17,315 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-11-18 22:34:17,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:34:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:34:17,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2018-11-18 22:34:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:34:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2018-11-18 22:34:17,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2018-11-18 22:34:21,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 26 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-18 22:34:21,848 INFO L225 Difference]: With dead ends: 24 [2018-11-18 22:34:21,848 INFO L226 Difference]: Without dead ends: 20 [2018-11-18 22:34:21,848 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:34:21,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-18 22:34:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-18 22:34:21,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:34:21,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-18 22:34:21,866 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-18 22:34:21,866 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-18 22:34:21,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:34:21,868 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-18 22:34:21,869 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-18 22:34:21,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:34:21,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:34:21,869 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-18 22:34:21,870 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-18 22:34:21,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:34:21,872 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-18 22:34:21,872 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-18 22:34:21,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:34:21,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:34:21,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:34:21,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:34:21,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:34:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-18 22:34:21,875 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 14 [2018-11-18 22:34:21,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:34:21,875 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-18 22:34:21,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 22:34:21,875 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-18 22:34:21,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 22:34:21,876 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:34:21,876 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:34:21,877 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:34:21,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:34:21,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1859945351, now seen corresponding path program 3 times [2018-11-18 22:34:21,878 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:34:21,878 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:34:21,899 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 22:34:22,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 22:34:22,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:34:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:34:22,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:34:22,850 INFO L256 TraceCheckUtils]: 0: Hoare triple {519#true} call ULTIMATE.init(); {519#true} is VALID [2018-11-18 22:34:22,850 INFO L273 TraceCheckUtils]: 1: Hoare triple {519#true} ~__return_main~0 := 0bv32;~__return_60~0 := 0bv32; {519#true} is VALID [2018-11-18 22:34:22,851 INFO L273 TraceCheckUtils]: 2: Hoare triple {519#true} assume true; {519#true} is VALID [2018-11-18 22:34:22,851 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {519#true} {519#true} #28#return; {519#true} is VALID [2018-11-18 22:34:22,852 INFO L256 TraceCheckUtils]: 4: Hoare triple {519#true} call #t~ret2 := main(); {519#true} is VALID [2018-11-18 22:34:22,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {519#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {519#true} is VALID [2018-11-18 22:34:22,852 INFO L273 TraceCheckUtils]: 6: Hoare triple {519#true} assume !!~bvsle32(1bv32, ~main__n~0); {542#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-18 22:34:22,853 INFO L273 TraceCheckUtils]: 7: Hoare triple {542#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {546#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-18 22:34:22,854 INFO L273 TraceCheckUtils]: 8: Hoare triple {546#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {550#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv2 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 22:34:22,856 INFO L273 TraceCheckUtils]: 9: Hoare triple {550#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv2 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {554#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv3 32) main_~main__sum~0) (= (_ bv3 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:34:22,859 INFO L273 TraceCheckUtils]: 10: Hoare triple {554#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv3 32) main_~main__sum~0) (= (_ bv3 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {558#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv4 32) main_~main__i~0) (= (_ bv6 32) main_~main__sum~0))} is VALID [2018-11-18 22:34:22,862 INFO L273 TraceCheckUtils]: 11: Hoare triple {558#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv4 32) main_~main__i~0) (= (_ bv6 32) main_~main__sum~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {562#(and (= (_ bv10 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv5 32) main_~main__i~0))} is VALID [2018-11-18 22:34:22,863 INFO L273 TraceCheckUtils]: 12: Hoare triple {562#(and (= (_ bv10 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv5 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {566#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv6 32) main_~main__i~0) (= (_ bv15 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:34:22,865 INFO L273 TraceCheckUtils]: 13: Hoare triple {566#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv6 32) main_~main__i~0) (= (_ bv15 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {570#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv7 32) main_~main__i~0) (= (_ bv21 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:34:22,865 INFO L273 TraceCheckUtils]: 14: Hoare triple {570#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv7 32) main_~main__i~0) (= (_ bv21 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {574#(and (= (_ bv28 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv8 32) main_~main__i~0))} is VALID [2018-11-18 22:34:22,866 INFO L273 TraceCheckUtils]: 15: Hoare triple {574#(and (= (_ bv28 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv8 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {578#(and (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv36 32) main_~main__sum~0) (= (_ bv9 32) main_~main__i~0) (bvsle (_ bv8 32) main_~main__n~0))} is VALID [2018-11-18 22:34:22,878 INFO L273 TraceCheckUtils]: 16: Hoare triple {578#(and (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv36 32) main_~main__sum~0) (= (_ bv9 32) main_~main__i~0) (bvsle (_ bv8 32) main_~main__n~0))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {582#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:34:22,879 INFO L273 TraceCheckUtils]: 17: Hoare triple {582#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {520#false} is VALID [2018-11-18 22:34:22,879 INFO L273 TraceCheckUtils]: 18: Hoare triple {520#false} assume !false; {520#false} is VALID [2018-11-18 22:34:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:34:22,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:34:27,395 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-18 22:34:29,871 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 22:34:32,390 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-18 22:34:37,511 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-18 22:34:40,180 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-18 22:34:42,941 INFO L273 TraceCheckUtils]: 18: Hoare triple {520#false} assume !false; {520#false} is VALID [2018-11-18 22:34:42,942 INFO L273 TraceCheckUtils]: 17: Hoare triple {592#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {520#false} is VALID [2018-11-18 22:34:42,950 INFO L273 TraceCheckUtils]: 16: Hoare triple {596#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {592#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-18 22:34:42,994 INFO L273 TraceCheckUtils]: 15: Hoare triple {600#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {596#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} is VALID [2018-11-18 22:34:45,000 INFO L273 TraceCheckUtils]: 14: Hoare triple {604#(or (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv4 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv2 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {600#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:34:47,007 INFO L273 TraceCheckUtils]: 13: Hoare triple {608#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv6 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv6 32))) (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {604#(or (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv4 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv2 32))))} is UNKNOWN [2018-11-18 22:34:49,013 INFO L273 TraceCheckUtils]: 12: Hoare triple {612#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv8 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv12 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {608#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv6 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv6 32))) (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:34:51,020 INFO L273 TraceCheckUtils]: 11: Hoare triple {616#(or (not (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv10 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv20 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {612#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv8 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv12 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:34:53,027 INFO L273 TraceCheckUtils]: 10: Hoare triple {620#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv12 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv30 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {616#(or (not (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv10 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv20 32))))} is UNKNOWN [2018-11-18 22:34:55,033 INFO L273 TraceCheckUtils]: 9: Hoare triple {624#(or (not (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv14 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv42 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {620#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv12 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv30 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:34:57,040 INFO L273 TraceCheckUtils]: 8: Hoare triple {628#(or (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv16 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv56 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {624#(or (not (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv14 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv42 32))))} is UNKNOWN [2018-11-18 22:34:57,052 INFO L273 TraceCheckUtils]: 7: Hoare triple {519#true} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {628#(or (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv16 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv56 32))))} is VALID [2018-11-18 22:34:57,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {519#true} assume !!~bvsle32(1bv32, ~main__n~0); {519#true} is VALID [2018-11-18 22:34:57,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {519#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {519#true} is VALID [2018-11-18 22:34:57,053 INFO L256 TraceCheckUtils]: 4: Hoare triple {519#true} call #t~ret2 := main(); {519#true} is VALID [2018-11-18 22:34:57,053 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {519#true} {519#true} #28#return; {519#true} is VALID [2018-11-18 22:34:57,053 INFO L273 TraceCheckUtils]: 2: Hoare triple {519#true} assume true; {519#true} is VALID [2018-11-18 22:34:57,054 INFO L273 TraceCheckUtils]: 1: Hoare triple {519#true} ~__return_main~0 := 0bv32;~__return_60~0 := 0bv32; {519#true} is VALID [2018-11-18 22:34:57,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {519#true} call ULTIMATE.init(); {519#true} is VALID [2018-11-18 22:34:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:34:57,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:34:57,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-11-18 22:34:57,060 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2018-11-18 22:34:57,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:34:57,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-18 22:35:11,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 24 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2018-11-18 22:35:11,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 22:35:11,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 22:35:11,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-11-18 22:35:11,380 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2018-11-18 22:35:13,628 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-18 22:35:14,080 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 22:35:14,483 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 22:35:14,908 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 22:35:15,366 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-18 22:35:17,505 WARN L180 SmtUtils]: Spent 843.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2018-11-18 22:35:19,387 WARN L180 SmtUtils]: Spent 856.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-18 22:35:20,763 WARN L180 SmtUtils]: Spent 900.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-11-18 22:35:22,250 WARN L180 SmtUtils]: Spent 731.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-18 22:35:23,913 WARN L180 SmtUtils]: Spent 685.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-18 22:35:25,398 WARN L180 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 22:35:26,801 WARN L180 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 22:35:28,011 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-18 22:35:29,167 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-18 22:35:33,847 WARN L180 SmtUtils]: Spent 806.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-18 22:35:34,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:35:34,695 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2018-11-18 22:35:34,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 22:35:34,695 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2018-11-18 22:35:34,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:35:34,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:35:34,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 43 transitions. [2018-11-18 22:35:34,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:35:34,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 43 transitions. [2018-11-18 22:35:34,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 43 transitions. [2018-11-18 22:35:52,422 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 36 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2018-11-18 22:35:52,423 INFO L225 Difference]: With dead ends: 34 [2018-11-18 22:35:52,424 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 22:35:52,425 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=472, Invalid=1168, Unknown=0, NotChecked=0, Total=1640 [2018-11-18 22:35:52,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 22:35:52,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-18 22:35:52,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:35:52,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-18 22:35:52,581 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-18 22:35:52,581 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-18 22:35:52,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:35:52,584 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-18 22:35:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-18 22:35:52,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:35:52,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:35:52,585 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-18 22:35:52,585 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-18 22:35:52,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:35:52,587 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-18 22:35:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-18 22:35:52,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:35:52,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:35:52,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:35:52,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:35:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 22:35:52,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-18 22:35:52,591 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 19 [2018-11-18 22:35:52,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:35:52,591 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-18 22:35:52,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 22:35:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-18 22:35:52,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 22:35:52,592 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:35:52,592 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:35:52,593 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:35:52,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:35:52,593 INFO L82 PathProgramCache]: Analyzing trace with hash 800608551, now seen corresponding path program 4 times [2018-11-18 22:35:52,593 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 22:35:52,594 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 22:35:52,613 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:35:52,718 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:35:52,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:35:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:35:52,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:35:53,071 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-18 22:35:54,356 INFO L256 TraceCheckUtils]: 0: Hoare triple {861#true} call ULTIMATE.init(); {861#true} is VALID [2018-11-18 22:35:54,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {861#true} ~__return_main~0 := 0bv32;~__return_60~0 := 0bv32; {861#true} is VALID [2018-11-18 22:35:54,357 INFO L273 TraceCheckUtils]: 2: Hoare triple {861#true} assume true; {861#true} is VALID [2018-11-18 22:35:54,357 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {861#true} {861#true} #28#return; {861#true} is VALID [2018-11-18 22:35:54,358 INFO L256 TraceCheckUtils]: 4: Hoare triple {861#true} call #t~ret2 := main(); {861#true} is VALID [2018-11-18 22:35:54,358 INFO L273 TraceCheckUtils]: 5: Hoare triple {861#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {861#true} is VALID [2018-11-18 22:35:54,364 INFO L273 TraceCheckUtils]: 6: Hoare triple {861#true} assume !!~bvsle32(1bv32, ~main__n~0); {884#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-18 22:35:54,364 INFO L273 TraceCheckUtils]: 7: Hoare triple {884#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {888#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} is VALID [2018-11-18 22:35:54,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {888#(and (= main_~main__sum~0 (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv1 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {892#(and (= (_ bv1 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv2 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:35:54,367 INFO L273 TraceCheckUtils]: 9: Hoare triple {892#(and (= (_ bv1 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv2 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {896#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv3 32) main_~main__sum~0) (= (_ bv3 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:35:54,369 INFO L273 TraceCheckUtils]: 10: Hoare triple {896#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv3 32) main_~main__sum~0) (= (_ bv3 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {900#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__i~0 (_ bv2 32)) main_~main__sum~0) (= (_ bv6 32) main_~main__sum~0))} is VALID [2018-11-18 22:35:54,369 INFO L273 TraceCheckUtils]: 11: Hoare triple {900#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__i~0 (_ bv2 32)) main_~main__sum~0) (= (_ bv6 32) main_~main__sum~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {904#(and (= (bvadd main_~main__i~0 (_ bv5 32)) main_~main__sum~0) (= (_ bv10 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:35:54,370 INFO L273 TraceCheckUtils]: 12: Hoare triple {904#(and (= (bvadd main_~main__i~0 (_ bv5 32)) main_~main__sum~0) (= (_ bv10 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {908#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv6 32) main_~main__i~0) (= (_ bv15 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:35:54,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {908#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv6 32) main_~main__i~0) (= (_ bv15 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {912#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv21 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967282 32)) main_~main__i~0))} is VALID [2018-11-18 22:35:54,374 INFO L273 TraceCheckUtils]: 14: Hoare triple {912#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv21 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967282 32)) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {916#(and (= (_ bv28 32) main_~main__sum~0) (= (bvadd main_~main__sum~0 (_ bv4294967276 32)) main_~main__i~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:35:54,377 INFO L273 TraceCheckUtils]: 15: Hoare triple {916#(and (= (_ bv28 32) main_~main__sum~0) (= (bvadd main_~main__sum~0 (_ bv4294967276 32)) main_~main__i~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {920#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv9 32) main_~main__i~0) (= (bvadd main_~main__sum~0 (_ bv4294967260 32)) (_ bv0 32)))} is VALID [2018-11-18 22:35:54,378 INFO L273 TraceCheckUtils]: 16: Hoare triple {920#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv9 32) main_~main__i~0) (= (bvadd main_~main__sum~0 (_ bv4294967260 32)) (_ bv0 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {924#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv10 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv45 32) main_~main__sum~0))} is VALID [2018-11-18 22:35:54,379 INFO L273 TraceCheckUtils]: 17: Hoare triple {924#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv10 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv45 32) main_~main__sum~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {928#(and (= (_ bv11 32) main_~main__i~0) (= (_ bv55 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:35:54,380 INFO L273 TraceCheckUtils]: 18: Hoare triple {928#(and (= (_ bv11 32) main_~main__i~0) (= (_ bv55 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {932#(and (= (_ bv66 32) main_~main__sum~0) (= (_ bv12 32) main_~main__i~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:35:54,382 INFO L273 TraceCheckUtils]: 19: Hoare triple {932#(and (= (_ bv66 32) main_~main__sum~0) (= (_ bv12 32) main_~main__i~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {936#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv78 32) main_~main__sum~0) (= (_ bv13 32) main_~main__i~0))} is VALID [2018-11-18 22:35:54,397 INFO L273 TraceCheckUtils]: 20: Hoare triple {936#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv78 32) main_~main__sum~0) (= (_ bv13 32) main_~main__i~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {940#(and (= (_ bv91 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv14 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:35:54,398 INFO L273 TraceCheckUtils]: 21: Hoare triple {940#(and (= (_ bv91 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv14 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {944#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967206 32)) main_~main__i~0) (= (_ bv105 32) main_~main__sum~0))} is VALID [2018-11-18 22:35:54,401 INFO L273 TraceCheckUtils]: 22: Hoare triple {944#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967206 32)) main_~main__i~0) (= (_ bv105 32) main_~main__sum~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {948#(and (= (_ bv16 32) main_~main__i~0) (= (_ bv120 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:35:54,403 INFO L273 TraceCheckUtils]: 23: Hoare triple {948#(and (= (_ bv16 32) main_~main__i~0) (= (_ bv120 32) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {952#(and (bvsle (_ bv16 32) main_~main__n~0) (= (_ bv17 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv136 32) main_~main__sum~0))} is VALID [2018-11-18 22:35:54,404 INFO L273 TraceCheckUtils]: 24: Hoare triple {952#(and (bvsle (_ bv16 32) main_~main__n~0) (= (_ bv17 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv136 32) main_~main__sum~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {956#(and (= (bvadd main_~main__sum~0 (_ bv4294967143 32)) (_ bv0 32)) (bvsle (_ bv16 32) main_~main__n~0) (= (bvadd main_~main__sum~0 (_ bv4294967161 32)) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-18 22:35:54,408 INFO L273 TraceCheckUtils]: 25: Hoare triple {956#(and (= (bvadd main_~main__sum~0 (_ bv4294967143 32)) (_ bv0 32)) (bvsle (_ bv16 32) main_~main__n~0) (= (bvadd main_~main__sum~0 (_ bv4294967161 32)) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {960#(and (= (_ bv171 32) main_~main__sum~0) (bvsle (bvadd main_~main__sum~0 (_ bv4294967143 32)) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967144 32)) main_~main__i~0))} is VALID [2018-11-18 22:35:54,418 INFO L273 TraceCheckUtils]: 26: Hoare triple {960#(and (= (_ bv171 32) main_~main__sum~0) (bvsle (bvadd main_~main__sum~0 (_ bv4294967143 32)) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967144 32)) main_~main__i~0))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {964#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 22:35:54,422 INFO L273 TraceCheckUtils]: 27: Hoare triple {964#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {862#false} is VALID [2018-11-18 22:35:54,423 INFO L273 TraceCheckUtils]: 28: Hoare triple {862#false} assume !false; {862#false} is VALID [2018-11-18 22:35:54,425 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:35:54,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 22:35:56,882 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-18 22:35:59,399 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-18 22:36:02,042 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-18 22:36:04,728 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-18 22:36:07,487 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-18 22:36:10,360 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:13,285 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:16,273 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:19,164 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:22,106 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:25,336 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:28,333 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:31,490 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:34,988 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:38,477 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:42,023 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:45,395 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:49,171 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 22:36:49,228 INFO L273 TraceCheckUtils]: 28: Hoare triple {862#false} assume !false; {862#false} is VALID [2018-11-18 22:36:49,229 INFO L273 TraceCheckUtils]: 27: Hoare triple {974#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {862#false} is VALID [2018-11-18 22:36:49,239 INFO L273 TraceCheckUtils]: 26: Hoare triple {978#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} assume !~bvsle32(~main__i~0, ~main__n~0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvmul32(2bv32, ~main__sum~0) == ~bvmul32(~main__n~0, ~bvadd32(1bv32, ~main__n~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {974#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-18 22:36:49,280 INFO L273 TraceCheckUtils]: 25: Hoare triple {982#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {978#(or (bvsle main_~main__i~0 main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvmul (_ bv2 32) main_~main__sum~0)))} is VALID [2018-11-18 22:36:51,287 INFO L273 TraceCheckUtils]: 24: Hoare triple {986#(or (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv4 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv2 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {982#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv2 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:36:53,294 INFO L273 TraceCheckUtils]: 23: Hoare triple {990#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv6 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv6 32))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {986#(or (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv4 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv2 32))))} is UNKNOWN [2018-11-18 22:36:55,301 INFO L273 TraceCheckUtils]: 22: Hoare triple {994#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv8 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv12 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {990#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv6 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv6 32))) (not (bvsle main_~main__i~0 main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:36:57,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {998#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv10 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv20 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {994#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv8 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv12 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv1 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:36:59,317 INFO L273 TraceCheckUtils]: 20: Hoare triple {1002#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv12 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv30 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {998#(or (not (bvsle (bvadd main_~main__i~0 (_ bv2 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv10 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv20 32))))} is UNKNOWN [2018-11-18 22:37:01,325 INFO L273 TraceCheckUtils]: 19: Hoare triple {1006#(or (not (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv14 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv42 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1002#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv12 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv30 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv3 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:37:03,333 INFO L273 TraceCheckUtils]: 18: Hoare triple {1010#(or (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv16 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv56 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1006#(or (not (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv4 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv14 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv42 32))))} is UNKNOWN [2018-11-18 22:37:05,341 INFO L273 TraceCheckUtils]: 17: Hoare triple {1014#(or (not (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv9 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv18 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv72 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1010#(or (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv5 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv16 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv56 32))))} is UNKNOWN [2018-11-18 22:37:07,348 INFO L273 TraceCheckUtils]: 16: Hoare triple {1018#(or (bvsle (bvadd main_~main__i~0 (_ bv10 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv20 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv90 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv9 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1014#(or (not (bvsle (bvadd main_~main__i~0 (_ bv6 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv9 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv18 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv72 32))))} is UNKNOWN [2018-11-18 22:37:09,356 INFO L273 TraceCheckUtils]: 15: Hoare triple {1022#(or (not (bvsle (bvadd main_~main__i~0 (_ bv10 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv11 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv22 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv110 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1018#(or (bvsle (bvadd main_~main__i~0 (_ bv10 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv20 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv90 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv9 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv7 32)) main_~main__n~0)))} is UNKNOWN [2018-11-18 22:37:11,364 INFO L273 TraceCheckUtils]: 14: Hoare triple {1026#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv24 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv132 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv11 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv12 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv9 32)) main_~main__n~0)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1022#(or (not (bvsle (bvadd main_~main__i~0 (_ bv10 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv11 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv8 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv22 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv110 32))))} is UNKNOWN [2018-11-18 22:37:13,371 INFO L273 TraceCheckUtils]: 13: Hoare triple {1030#(or (not (bvsle (bvadd main_~main__i~0 (_ bv12 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv10 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv26 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv156 32))) (bvsle (bvadd main_~main__i~0 (_ bv13 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1026#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv24 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv132 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv11 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv12 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv9 32)) main_~main__n~0)))} is UNKNOWN [2018-11-18 22:37:15,380 INFO L273 TraceCheckUtils]: 12: Hoare triple {1034#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv28 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv182 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv11 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv13 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv14 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1030#(or (not (bvsle (bvadd main_~main__i~0 (_ bv12 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv10 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv26 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv156 32))) (bvsle (bvadd main_~main__i~0 (_ bv13 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:37:17,388 INFO L273 TraceCheckUtils]: 11: Hoare triple {1038#(or (not (bvsle (bvadd main_~main__i~0 (_ bv14 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv12 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv15 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv30 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv210 32))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1034#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv28 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv182 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv11 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv13 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv14 32)) main_~main__n~0))} is UNKNOWN [2018-11-18 22:37:19,396 INFO L273 TraceCheckUtils]: 10: Hoare triple {1042#(or (bvsle (bvadd main_~main__i~0 (_ bv16 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv15 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv13 32)) main_~main__n~0)) (= (bvadd (bvmul (_ bv32 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv240 32)) (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32)))))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1038#(or (not (bvsle (bvadd main_~main__i~0 (_ bv14 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv12 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv15 32)) main_~main__n~0) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv30 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv210 32))))} is UNKNOWN [2018-11-18 22:37:21,404 INFO L273 TraceCheckUtils]: 9: Hoare triple {1046#(or (not (bvsle (bvadd main_~main__i~0 (_ bv14 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv34 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv272 32))) (bvsle (bvadd main_~main__i~0 (_ bv17 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv16 32)) main_~main__n~0)))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1042#(or (bvsle (bvadd main_~main__i~0 (_ bv16 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv15 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv13 32)) main_~main__n~0)) (= (bvadd (bvmul (_ bv32 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv240 32)) (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32)))))} is UNKNOWN [2018-11-18 22:37:23,412 INFO L273 TraceCheckUtils]: 8: Hoare triple {1050#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv36 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv306 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv15 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv17 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv18 32)) main_~main__n~0))} assume ~bvsle32(~main__i~0, ~main__n~0);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {1046#(or (not (bvsle (bvadd main_~main__i~0 (_ bv14 32)) main_~main__n~0)) (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv34 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv272 32))) (bvsle (bvadd main_~main__i~0 (_ bv17 32)) main_~main__n~0) (not (bvsle (bvadd main_~main__i~0 (_ bv16 32)) main_~main__n~0)))} is UNKNOWN [2018-11-18 22:37:23,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {861#true} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {1050#(or (= (bvmul main_~main__n~0 (bvadd main_~main__n~0 (_ bv1 32))) (bvadd (bvmul (_ bv36 32) main_~main__i~0) (bvmul (_ bv2 32) main_~main__sum~0) (_ bv306 32))) (not (bvsle (bvadd main_~main__i~0 (_ bv15 32)) main_~main__n~0)) (not (bvsle (bvadd main_~main__i~0 (_ bv17 32)) main_~main__n~0)) (bvsle (bvadd main_~main__i~0 (_ bv18 32)) main_~main__n~0))} is VALID [2018-11-18 22:37:23,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {861#true} assume !!~bvsle32(1bv32, ~main__n~0); {861#true} is VALID [2018-11-18 22:37:23,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {861#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {861#true} is VALID [2018-11-18 22:37:23,423 INFO L256 TraceCheckUtils]: 4: Hoare triple {861#true} call #t~ret2 := main(); {861#true} is VALID [2018-11-18 22:37:23,424 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {861#true} {861#true} #28#return; {861#true} is VALID [2018-11-18 22:37:23,424 INFO L273 TraceCheckUtils]: 2: Hoare triple {861#true} assume true; {861#true} is VALID [2018-11-18 22:37:23,424 INFO L273 TraceCheckUtils]: 1: Hoare triple {861#true} ~__return_main~0 := 0bv32;~__return_60~0 := 0bv32; {861#true} is VALID [2018-11-18 22:37:23,424 INFO L256 TraceCheckUtils]: 0: Hoare triple {861#true} call ULTIMATE.init(); {861#true} is VALID [2018-11-18 22:37:23,429 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:37:23,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:37:23,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2018-11-18 22:37:23,431 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 29 [2018-11-18 22:37:23,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:37:23,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states.