java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:43:09,110 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:43:09,112 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:43:09,131 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:43:09,131 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:43:09,132 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:43:09,134 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:43:09,137 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:43:09,138 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:43:09,142 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:43:09,143 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:43:09,143 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:43:09,145 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:43:09,146 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:43:09,148 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:43:09,148 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:43:09,151 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:43:09,153 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:43:09,162 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:43:09,166 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:43:09,167 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:43:09,169 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:43:09,171 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:43:09,171 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:43:09,171 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:43:09,172 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:43:09,173 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:43:09,173 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:43:09,174 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:43:09,175 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:43:09,175 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:43:09,176 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:43:09,176 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:43:09,177 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:43:09,177 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:43:09,178 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:43:09,178 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-23 11:43:09,194 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:43:09,194 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:43:09,195 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:43:09,195 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:43:09,196 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:43:09,196 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:43:09,196 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:43:09,196 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:43:09,197 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:43:09,197 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:43:09,197 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:43:09,197 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:43:09,197 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:43:09,198 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:43:09,198 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:43:09,198 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:43:09,198 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:43:09,198 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:43:09,198 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:43:09,199 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:43:09,199 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:43:09,199 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:43:09,199 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:43:09,199 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:43:09,200 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:43:09,200 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:43:09,200 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:43:09,200 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:43:09,200 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:43:09,201 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:43:09,201 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:43:09,201 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:43:09,201 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:43:09,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:43:09,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:43:09,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:43:09,273 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:43:09,273 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:43:09,274 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.p+lhb-reducer.c [2018-11-23 11:43:09,350 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805aa0015/48e4511521794deda81a2069b4ef8a29/FLAGbbc6fa177 [2018-11-23 11:43:09,791 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:43:09,792 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum_true-unreach-call.i.p+lhb-reducer.c [2018-11-23 11:43:09,799 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805aa0015/48e4511521794deda81a2069b4ef8a29/FLAGbbc6fa177 [2018-11-23 11:43:10,137 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/805aa0015/48e4511521794deda81a2069b4ef8a29 [2018-11-23 11:43:10,147 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:43:10,149 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:43:10,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:43:10,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:43:10,156 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:43:10,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:43:10" (1/1) ... [2018-11-23 11:43:10,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3012dcb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:10, skipping insertion in model container [2018-11-23 11:43:10,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:43:10" (1/1) ... [2018-11-23 11:43:10,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:43:10,210 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:43:10,482 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:43:10,489 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:43:10,520 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:43:10,544 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:43:10,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:10 WrapperNode [2018-11-23 11:43:10,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:43:10,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:43:10,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:43:10,546 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:43:10,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:10" (1/1) ... [2018-11-23 11:43:10,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:10" (1/1) ... [2018-11-23 11:43:10,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:43:10,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:43:10,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:43:10,577 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:43:10,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:10" (1/1) ... [2018-11-23 11:43:10,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:10" (1/1) ... [2018-11-23 11:43:10,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:10" (1/1) ... [2018-11-23 11:43:10,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:10" (1/1) ... [2018-11-23 11:43:10,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:10" (1/1) ... [2018-11-23 11:43:10,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:10" (1/1) ... [2018-11-23 11:43:10,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:10" (1/1) ... [2018-11-23 11:43:10,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:43:10,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:43:10,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:43:10,606 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:43:10,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:43:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:43:10,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:43:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:43:10,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:43:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:43:10,733 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:43:11,290 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:43:11,290 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 11:43:11,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:43:11 BoogieIcfgContainer [2018-11-23 11:43:11,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:43:11,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:43:11,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:43:11,296 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:43:11,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:43:10" (1/3) ... [2018-11-23 11:43:11,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1a86cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:43:11, skipping insertion in model container [2018-11-23 11:43:11,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:43:10" (2/3) ... [2018-11-23 11:43:11,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1a86cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:43:11, skipping insertion in model container [2018-11-23 11:43:11,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:43:11" (3/3) ... [2018-11-23 11:43:11,301 INFO L112 eAbstractionObserver]: Analyzing ICFG gauss_sum_true-unreach-call.i.p+lhb-reducer.c [2018-11-23 11:43:11,311 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:43:11,320 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:43:11,339 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:43:11,372 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:43:11,373 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:43:11,373 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:43:11,373 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:43:11,373 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:43:11,373 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:43:11,374 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:43:11,374 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:43:11,374 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:43:11,393 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 11:43:11,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:43:11,400 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:43:11,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:43:11,403 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:43:11,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:43:11,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1720236422, now seen corresponding path program 1 times [2018-11-23 11:43:11,413 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:43:11,413 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-23 11:43:11,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:43:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:43:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:43:11,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:43:12,028 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-23 11:43:12,459 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-11-23 11:43:12,798 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-11-23 11:43:12,883 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 11:43:12,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} ~__return_main~0 := 0bv32;~__return_96~0 := 0bv32; {24#true} is VALID [2018-11-23 11:43:12,888 INFO L273 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 11:43:12,888 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #48#return; {24#true} is VALID [2018-11-23 11:43:12,889 INFO L256 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret2 := main(); {24#true} is VALID [2018-11-23 11:43:12,889 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2018-11-23 11:43:12,890 INFO L273 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!~bvsle32(1bv32, ~main__n~0); {47#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-23 11:43:12,893 INFO L273 TraceCheckUtils]: 7: Hoare triple {47#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {51#(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-23 11:43:12,894 INFO L273 TraceCheckUtils]: 8: Hoare triple {51#(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); {55#(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-23 11:43:12,899 INFO L273 TraceCheckUtils]: 9: Hoare triple {55#(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);~main__sum~0 := ~bvadd32(~main__sum~0, ~main__i~0);~main__i~0 := ~bvadd32(1bv32, ~main__i~0); {59#(and (= (bvadd (bvmul (_ bv2 32) main_~main__i~0) (_ bv4294967293 32)) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv3 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-23 11:43:12,910 INFO L273 TraceCheckUtils]: 10: Hoare triple {59#(and (= (bvadd (bvmul (_ bv2 32) main_~main__i~0) (_ bv4294967293 32)) main_~main__sum~0) (bvsle (_ bv1 32) main_~main__n~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); {63#(and (= (bvadd main_~main__sum~0 (_ bv4294967290 32)) (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv4 32) main_~main__i~0))} is VALID [2018-11-23 11:43:12,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {63#(and (= (bvadd main_~main__sum~0 (_ bv4294967290 32)) (_ bv0 32)) (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv4 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); {67#(and (= (_ bv10 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv5 32) main_~main__i~0) (bvsle (_ bv4 32) main_~main__n~0))} is VALID [2018-11-23 11:43:12,916 INFO L273 TraceCheckUtils]: 12: Hoare triple {67#(and (= (_ bv10 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv5 32) main_~main__i~0) (bvsle (_ 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); {71#(and (bvsle (_ bv5 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-23 11:43:12,926 INFO L273 TraceCheckUtils]: 13: Hoare triple {71#(and (bvsle (_ bv5 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);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; {75#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:43:12,928 INFO L273 TraceCheckUtils]: 14: Hoare triple {75#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {25#false} is VALID [2018-11-23 11:43:12,928 INFO L273 TraceCheckUtils]: 15: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 11:43:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:43:12,933 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:43:12,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:43:12,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 11:43:12,945 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-23 11:43:12,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:43:12,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:43:13,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:43:13,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:43:13,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:43:13,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:43:13,041 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 10 states. [2018-11-23 11:43:15,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:43:15,065 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-11-23 11:43:15,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:43:15,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-23 11:43:15,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:43:15,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:43:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2018-11-23 11:43:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:43:15,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2018-11-23 11:43:15,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2018-11-23 11:43:15,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:43:15,219 INFO L225 Difference]: With dead ends: 41 [2018-11-23 11:43:15,219 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 11:43:15,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:43:15,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 11:43:15,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 11:43:15,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:43:15,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 11:43:15,271 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 11:43:15,271 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 11:43:15,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:43:15,275 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 11:43:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 11:43:15,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:43:15,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:43:15,276 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 11:43:15,276 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 11:43:15,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:43:15,279 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 11:43:15,280 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 11:43:15,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:43:15,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:43:15,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:43:15,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:43:15,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:43:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 11:43:15,285 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-11-23 11:43:15,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:43:15,285 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-23 11:43:15,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:43:15,286 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 11:43:15,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:43:15,286 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:43:15,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:43:15,287 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:43:15,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:43:15,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1787659072, now seen corresponding path program 1 times [2018-11-23 11:43:15,288 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:43:15,288 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-23 11:43:15,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:43:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:43:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:43:15,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:43:16,055 INFO L256 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2018-11-23 11:43:16,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {190#true} ~__return_main~0 := 0bv32;~__return_96~0 := 0bv32; {190#true} is VALID [2018-11-23 11:43:16,056 INFO L273 TraceCheckUtils]: 2: Hoare triple {190#true} assume true; {190#true} is VALID [2018-11-23 11:43:16,056 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {190#true} {190#true} #48#return; {190#true} is VALID [2018-11-23 11:43:16,056 INFO L256 TraceCheckUtils]: 4: Hoare triple {190#true} call #t~ret2 := main(); {190#true} is VALID [2018-11-23 11:43:16,057 INFO L273 TraceCheckUtils]: 5: Hoare triple {190#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {190#true} is VALID [2018-11-23 11:43:16,058 INFO L273 TraceCheckUtils]: 6: Hoare triple {190#true} assume !!~bvsle32(1bv32, ~main__n~0); {213#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-23 11:43:16,059 INFO L273 TraceCheckUtils]: 7: Hoare triple {213#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {217#(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-23 11:43:16,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {217#(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); {221#(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-23 11:43:16,063 INFO L273 TraceCheckUtils]: 9: Hoare triple {221#(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); {225#(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-23 11:43:16,065 INFO L273 TraceCheckUtils]: 10: Hoare triple {225#(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); {229#(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-23 11:43:16,068 INFO L273 TraceCheckUtils]: 11: Hoare triple {229#(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); {233#(and (= (_ bv10 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv5 32) main_~main__i~0) (bvsle (_ bv4 32) main_~main__n~0))} is VALID [2018-11-23 11:43:16,070 INFO L273 TraceCheckUtils]: 12: Hoare triple {233#(and (= (_ bv10 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv5 32) main_~main__i~0) (bvsle (_ 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); {237#(and (= (_ bv6 32) main_~main__i~0) (= (_ bv15 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)) (bvsle (_ bv4 32) main_~main__n~0))} is VALID [2018-11-23 11:43:16,072 INFO L273 TraceCheckUtils]: 13: Hoare triple {237#(and (= (_ bv6 32) main_~main__i~0) (= (_ bv15 32) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)) (bvsle (_ 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); {241#(and (= (_ bv7 32) main_~main__i~0) (= (_ bv21 32) main_~main__sum~0) (bvsle (_ bv6 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-23 11:43:16,083 INFO L273 TraceCheckUtils]: 14: Hoare triple {241#(and (= (_ bv7 32) main_~main__i~0) (= (_ bv21 32) main_~main__sum~0) (bvsle (_ bv6 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 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; {245#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:43:16,083 INFO L273 TraceCheckUtils]: 15: Hoare triple {245#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {191#false} is VALID [2018-11-23 11:43:16,084 INFO L273 TraceCheckUtils]: 16: Hoare triple {191#false} assume !false; {191#false} is VALID [2018-11-23 11:43:16,085 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-23 11:43:16,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:43:22,620 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:43:25,156 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 11:43:27,754 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-23 11:43:30,463 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 11:43:30,524 INFO L273 TraceCheckUtils]: 16: Hoare triple {191#false} assume !false; {191#false} is VALID [2018-11-23 11:43:30,524 INFO L273 TraceCheckUtils]: 15: Hoare triple {255#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {191#false} is VALID [2018-11-23 11:43:30,533 INFO L273 TraceCheckUtils]: 14: Hoare triple {259#(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; {255#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-23 11:43:32,542 INFO L273 TraceCheckUtils]: 13: Hoare triple {263#(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); {259#(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 UNKNOWN [2018-11-23 11:43:34,549 INFO L273 TraceCheckUtils]: 12: Hoare triple {267#(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); {263#(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-23 11:43:36,556 INFO L273 TraceCheckUtils]: 11: Hoare triple {271#(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); {267#(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-23 11:43:38,564 INFO L273 TraceCheckUtils]: 10: Hoare triple {275#(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 (_ bv1 32)) main_~main__n~0)) (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); {271#(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-23 11:43:40,570 INFO L273 TraceCheckUtils]: 9: Hoare triple {279#(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); {275#(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 (_ bv1 32)) main_~main__n~0)) (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-23 11:43:42,577 INFO L273 TraceCheckUtils]: 8: Hoare triple {283#(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); {279#(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-23 11:43:42,587 INFO L273 TraceCheckUtils]: 7: Hoare triple {190#true} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {283#(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 VALID [2018-11-23 11:43:42,587 INFO L273 TraceCheckUtils]: 6: Hoare triple {190#true} assume !!~bvsle32(1bv32, ~main__n~0); {190#true} is VALID [2018-11-23 11:43:42,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {190#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {190#true} is VALID [2018-11-23 11:43:42,588 INFO L256 TraceCheckUtils]: 4: Hoare triple {190#true} call #t~ret2 := main(); {190#true} is VALID [2018-11-23 11:43:42,588 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {190#true} {190#true} #48#return; {190#true} is VALID [2018-11-23 11:43:42,589 INFO L273 TraceCheckUtils]: 2: Hoare triple {190#true} assume true; {190#true} is VALID [2018-11-23 11:43:42,589 INFO L273 TraceCheckUtils]: 1: Hoare triple {190#true} ~__return_main~0 := 0bv32;~__return_96~0 := 0bv32; {190#true} is VALID [2018-11-23 11:43:42,589 INFO L256 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2018-11-23 11:43:42,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:43:42,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:43:42,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-11-23 11:43:42,604 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2018-11-23 11:43:42,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:43:42,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:43:54,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 21 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2018-11-23 11:43:54,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:43:54,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:43:54,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:43:54,823 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 19 states. [2018-11-23 11:43:56,779 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 11:43:57,252 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:43:57,876 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 11:44:00,926 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2018-11-23 11:44:25,318 WARN L180 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2018-11-23 11:44:29,460 WARN L180 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2018-11-23 11:44:29,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:44:29,896 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 11:44:29,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:44:29,897 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2018-11-23 11:44:29,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:44:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:44:29,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-11-23 11:44:29,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:44:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-11-23 11:44:29,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 27 transitions. [2018-11-23 11:44:32,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 26 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:44:32,689 INFO L225 Difference]: With dead ends: 25 [2018-11-23 11:44:32,690 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:44:32,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=203, Invalid=499, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:44:32,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:44:32,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 11:44:32,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:44:32,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 11:44:32,728 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:44:32,728 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:44:32,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:44:32,731 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:44:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:44:32,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:44:32,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:44:32,732 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:44:32,732 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:44:32,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:44:32,734 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:44:32,735 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:44:32,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:44:32,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:44:32,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:44:32,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:44:32,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:44:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 11:44:32,738 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2018-11-23 11:44:32,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:44:32,738 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 11:44:32,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:44:32,738 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:44:32,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:44:32,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:44:32,740 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:44:32,740 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:44:32,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:44:32,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1505077242, now seen corresponding path program 2 times [2018-11-23 11:44:32,741 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:44:32,741 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-23 11:44:32,757 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:44:32,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:44:32,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:44:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:44:32,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:44:33,572 INFO L256 TraceCheckUtils]: 0: Hoare triple {432#true} call ULTIMATE.init(); {432#true} is VALID [2018-11-23 11:44:33,573 INFO L273 TraceCheckUtils]: 1: Hoare triple {432#true} ~__return_main~0 := 0bv32;~__return_96~0 := 0bv32; {432#true} is VALID [2018-11-23 11:44:33,573 INFO L273 TraceCheckUtils]: 2: Hoare triple {432#true} assume true; {432#true} is VALID [2018-11-23 11:44:33,574 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {432#true} {432#true} #48#return; {432#true} is VALID [2018-11-23 11:44:33,575 INFO L256 TraceCheckUtils]: 4: Hoare triple {432#true} call #t~ret2 := main(); {432#true} is VALID [2018-11-23 11:44:33,575 INFO L273 TraceCheckUtils]: 5: Hoare triple {432#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {432#true} is VALID [2018-11-23 11:44:33,578 INFO L273 TraceCheckUtils]: 6: Hoare triple {432#true} assume !!~bvsle32(1bv32, ~main__n~0); {455#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-23 11:44:33,579 INFO L273 TraceCheckUtils]: 7: Hoare triple {455#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {459#(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-23 11:44:33,580 INFO L273 TraceCheckUtils]: 8: Hoare triple {459#(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); {463#(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-23 11:44:33,582 INFO L273 TraceCheckUtils]: 9: Hoare triple {463#(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); {467#(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-23 11:44:33,585 INFO L273 TraceCheckUtils]: 10: Hoare triple {467#(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); {471#(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-23 11:44:33,588 INFO L273 TraceCheckUtils]: 11: Hoare triple {471#(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); {475#(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-23 11:44:33,591 INFO L273 TraceCheckUtils]: 12: Hoare triple {475#(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); {479#(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-23 11:44:33,593 INFO L273 TraceCheckUtils]: 13: Hoare triple {479#(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); {483#(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-23 11:44:33,597 INFO L273 TraceCheckUtils]: 14: Hoare triple {483#(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); {487#(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-23 11:44:33,599 INFO L273 TraceCheckUtils]: 15: Hoare triple {487#(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); {491#(and (bvsle (_ bv1 32) main_~main__n~0) (= (bvadd main_~main__sum~0 (_ bv4294967269 32)) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv36 32) main_~main__sum~0))} is VALID [2018-11-23 11:44:33,601 INFO L273 TraceCheckUtils]: 16: Hoare triple {491#(and (bvsle (_ bv1 32) main_~main__n~0) (= (bvadd main_~main__sum~0 (_ bv4294967269 32)) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv36 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); {495#(and (= (_ bv10 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv45 32) main_~main__sum~0) (bvsle (_ bv9 32) main_~main__n~0))} is VALID [2018-11-23 11:44:33,612 INFO L273 TraceCheckUtils]: 17: Hoare triple {495#(and (= (_ bv10 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv45 32) main_~main__sum~0) (bvsle (_ bv9 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; {499#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:44:33,613 INFO L273 TraceCheckUtils]: 18: Hoare triple {499#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {433#false} is VALID [2018-11-23 11:44:33,613 INFO L273 TraceCheckUtils]: 19: Hoare triple {433#false} assume !false; {433#false} is VALID [2018-11-23 11:44:33,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:44:33,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:44:39,735 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:44:42,334 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:44:44,949 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:44:47,681 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:44:50,482 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:44:53,312 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:44:56,178 INFO L273 TraceCheckUtils]: 19: Hoare triple {433#false} assume !false; {433#false} is VALID [2018-11-23 11:44:56,179 INFO L273 TraceCheckUtils]: 18: Hoare triple {509#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {433#false} is VALID [2018-11-23 11:44:56,188 INFO L273 TraceCheckUtils]: 17: Hoare triple {513#(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; {509#(not (= main_~__VERIFIER_assert__cond~0 (_ bv0 32)))} is VALID [2018-11-23 11:44:58,200 INFO L273 TraceCheckUtils]: 16: Hoare triple {517#(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); {513#(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 UNKNOWN [2018-11-23 11:45:00,208 INFO L273 TraceCheckUtils]: 15: Hoare triple {521#(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); {517#(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-23 11:45:02,216 INFO L273 TraceCheckUtils]: 14: Hoare triple {525#(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); {521#(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-23 11:45:04,224 INFO L273 TraceCheckUtils]: 13: Hoare triple {529#(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); {525#(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-23 11:45:06,231 INFO L273 TraceCheckUtils]: 12: Hoare triple {533#(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); {529#(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-23 11:45:08,238 INFO L273 TraceCheckUtils]: 11: Hoare triple {537#(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); {533#(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-23 11:45:10,247 INFO L273 TraceCheckUtils]: 10: Hoare triple {541#(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); {537#(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-23 11:45:12,255 INFO L273 TraceCheckUtils]: 9: Hoare triple {545#(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); {541#(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-23 11:45:14,262 INFO L273 TraceCheckUtils]: 8: Hoare triple {549#(or (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); {545#(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 UNKNOWN [2018-11-23 11:45:14,273 INFO L273 TraceCheckUtils]: 7: Hoare triple {432#true} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {549#(or (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 VALID [2018-11-23 11:45:14,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {432#true} assume !!~bvsle32(1bv32, ~main__n~0); {432#true} is VALID [2018-11-23 11:45:14,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {432#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {432#true} is VALID [2018-11-23 11:45:14,274 INFO L256 TraceCheckUtils]: 4: Hoare triple {432#true} call #t~ret2 := main(); {432#true} is VALID [2018-11-23 11:45:14,275 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {432#true} {432#true} #48#return; {432#true} is VALID [2018-11-23 11:45:14,275 INFO L273 TraceCheckUtils]: 2: Hoare triple {432#true} assume true; {432#true} is VALID [2018-11-23 11:45:14,275 INFO L273 TraceCheckUtils]: 1: Hoare triple {432#true} ~__return_main~0 := 0bv32;~__return_96~0 := 0bv32; {432#true} is VALID [2018-11-23 11:45:14,276 INFO L256 TraceCheckUtils]: 0: Hoare triple {432#true} call ULTIMATE.init(); {432#true} is VALID [2018-11-23 11:45:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:45:14,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:45:14,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-11-23 11:45:14,282 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 20 [2018-11-23 11:45:14,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:45:14,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:45:32,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 24 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2018-11-23 11:45:32,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:45:32,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:45:32,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:45:32,497 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 25 states. [2018-11-23 11:45:35,689 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 11:45:36,449 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:45:37,094 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:45:37,742 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:45:38,333 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:45:38,942 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:45:39,571 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 11:45:42,110 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 93 [2018-11-23 11:46:03,934 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 11:46:05,765 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 98 [2018-11-23 11:46:07,068 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 11:46:08,537 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 11:46:09,940 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-23 11:46:14,668 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 91 [2018-11-23 11:46:15,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:46:15,498 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 11:46:15,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:46:15,498 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 20 [2018-11-23 11:46:15,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:46:15,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:46:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2018-11-23 11:46:15,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:46:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2018-11-23 11:46:15,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 36 transitions. [2018-11-23 11:46:26,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 33 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-11-23 11:46:26,492 INFO L225 Difference]: With dead ends: 31 [2018-11-23 11:46:26,492 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 11:46:26,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=418, Invalid=1142, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:46:26,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 11:46:26,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 11:46:26,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:46:26,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 11:46:26,563 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:46:26,564 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:46:26,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:46:26,566 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 11:46:26,566 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 11:46:26,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:46:26,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:46:26,567 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:46:26,567 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:46:26,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:46:26,569 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 11:46:26,570 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 11:46:26,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:46:26,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:46:26,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:46:26,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:46:26,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:46:26,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-23 11:46:26,573 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2018-11-23 11:46:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:46:26,573 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-23 11:46:26,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 11:46:26,573 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 11:46:26,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:46:26,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:46:26,574 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:46:26,575 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:46:26,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:46:26,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1940303302, now seen corresponding path program 3 times [2018-11-23 11:46:26,576 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:46:26,576 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-23 11:46:26,594 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:46:27,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:46:27,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:46:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:46:27,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:46:28,340 INFO L256 TraceCheckUtils]: 0: Hoare triple {748#true} call ULTIMATE.init(); {748#true} is VALID [2018-11-23 11:46:28,340 INFO L273 TraceCheckUtils]: 1: Hoare triple {748#true} ~__return_main~0 := 0bv32;~__return_96~0 := 0bv32; {748#true} is VALID [2018-11-23 11:46:28,341 INFO L273 TraceCheckUtils]: 2: Hoare triple {748#true} assume true; {748#true} is VALID [2018-11-23 11:46:28,341 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {748#true} {748#true} #48#return; {748#true} is VALID [2018-11-23 11:46:28,341 INFO L256 TraceCheckUtils]: 4: Hoare triple {748#true} call #t~ret2 := main(); {748#true} is VALID [2018-11-23 11:46:28,341 INFO L273 TraceCheckUtils]: 5: Hoare triple {748#true} havoc ~main__n~0;havoc ~main__sum~0;havoc ~main__i~0;~main__n~0 := #t~nondet1;havoc #t~nondet1; {748#true} is VALID [2018-11-23 11:46:28,342 INFO L273 TraceCheckUtils]: 6: Hoare triple {748#true} assume !!~bvsle32(1bv32, ~main__n~0); {771#(bvsle (_ bv1 32) main_~main__n~0)} is VALID [2018-11-23 11:46:28,343 INFO L273 TraceCheckUtils]: 7: Hoare triple {771#(bvsle (_ bv1 32) main_~main__n~0)} assume !!~bvsle32(~main__n~0, 1000bv32);~main__sum~0 := 0bv32;~main__i~0 := 1bv32; {775#(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-23 11:46:28,344 INFO L273 TraceCheckUtils]: 8: Hoare triple {775#(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); {779#(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-23 11:46:28,345 INFO L273 TraceCheckUtils]: 9: Hoare triple {779#(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); {783#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv3 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:46:28,346 INFO L273 TraceCheckUtils]: 10: Hoare triple {783#(and (bvsle (_ bv1 32) main_~main__n~0) (= (_ bv3 32) main_~main__i~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (bvadd main_~main__sum~0 (_ bv4294967293 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); {787#(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-23 11:46:28,348 INFO L273 TraceCheckUtils]: 11: Hoare triple {787#(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); {791#(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-23 11:46:28,350 INFO L273 TraceCheckUtils]: 12: Hoare triple {791#(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); {795#(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-23 11:46:28,351 INFO L273 TraceCheckUtils]: 13: Hoare triple {795#(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); {799#(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-23 11:46:28,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {799#(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); {803#(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-23 11:46:28,353 INFO L273 TraceCheckUtils]: 15: Hoare triple {803#(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); {807#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv36 32) main_~main__sum~0) (= (_ bv9 32) main_~main__i~0))} is VALID [2018-11-23 11:46:28,360 INFO L273 TraceCheckUtils]: 16: Hoare triple {807#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv36 32) main_~main__sum~0) (= (_ bv9 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); {811#(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-23 11:46:28,361 INFO L273 TraceCheckUtils]: 17: Hoare triple {811#(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); {815#(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-23 11:46:28,362 INFO L273 TraceCheckUtils]: 18: Hoare triple {815#(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); {819#(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-23 11:46:28,362 INFO L273 TraceCheckUtils]: 19: Hoare triple {819#(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); {823#(and (bvsle (_ bv1 32) main_~main__n~0) (= (bvadd main_~main__i~0 (_ bv65 32)) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv78 32) main_~main__sum~0))} is VALID [2018-11-23 11:46:28,363 INFO L273 TraceCheckUtils]: 20: Hoare triple {823#(and (bvsle (_ bv1 32) main_~main__n~0) (= (bvadd main_~main__i~0 (_ bv65 32)) main_~main__sum~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv78 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); {827#(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-23 11:46:28,365 INFO L273 TraceCheckUtils]: 21: Hoare triple {827#(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); {831#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv15 32) main_~main__i~0) (= (_ bv105 32) main_~main__sum~0))} is VALID [2018-11-23 11:46:28,367 INFO L273 TraceCheckUtils]: 22: Hoare triple {831#(and (bvsle (_ bv1 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)) (= (_ bv15 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); {835#(and (= (_ bv16 32) main_~main__i~0) (= (_ bv120 32) main_~main__sum~0) (bvsle (_ bv15 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 32)))} is VALID [2018-11-23 11:46:28,380 INFO L273 TraceCheckUtils]: 23: Hoare triple {835#(and (= (_ bv16 32) main_~main__i~0) (= (_ bv120 32) main_~main__sum~0) (bvsle (_ bv15 32) main_~main__n~0) (bvsle main_~main__n~0 (_ bv1000 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; {839#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:46:28,381 INFO L273 TraceCheckUtils]: 24: Hoare triple {839#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~__VERIFIER_assert__cond~0; {749#false} is VALID [2018-11-23 11:46:28,382 INFO L273 TraceCheckUtils]: 25: Hoare triple {749#false} assume !false; {749#false} is VALID [2018-11-23 11:46:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:46:28,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:46:31,338 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-23 11:46:33,913 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 11:46:36,564 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:46:39,188 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:46:41,934 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:46:44,774 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:46:47,739 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:46:50,586 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:46:56,454 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 21