java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/loop-lit/bhmr2007_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:32:48,354 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:32:48,357 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:32:48,373 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:32:48,374 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:32:48,375 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:32:48,377 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:32:48,379 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:32:48,382 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:32:48,390 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:32:48,392 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:32:48,393 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:32:48,394 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:32:48,395 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:32:48,396 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:32:48,398 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:32:48,400 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:32:48,402 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:32:48,407 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:32:48,409 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:32:48,411 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:32:48,412 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:32:48,414 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:32:48,414 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:32:48,414 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:32:48,417 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:32:48,418 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:32:48,419 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:32:48,420 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:32:48,424 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:32:48,424 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:32:48,425 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:32:48,425 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:32:48,426 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:32:48,427 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:32:48,427 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:32:48,428 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:32:48,455 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:32:48,455 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:32:48,456 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:32:48,456 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:32:48,460 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:32:48,460 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:32:48,460 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:32:48,461 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:32:48,461 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:32:48,461 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:32:48,461 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:32:48,461 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:32:48,462 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:32:48,463 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:32:48,463 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:32:48,463 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:32:48,463 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:32:48,463 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:32:48,464 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:32:48,464 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:32:48,464 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:32:48,464 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:32:48,464 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:32:48,466 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:32:48,466 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:32:48,466 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:32:48,466 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:32:48,467 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:32:48,467 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:32:48,467 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:32:48,467 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:32:48,467 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:32:48,468 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:32:48,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:32:48,543 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:32:48,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:32:48,549 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:32:48,549 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:32:48,550 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/bhmr2007_true-unreach-call_true-termination.c.i [2018-11-14 18:32:48,611 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a895071c3/e63a3470c6f24a58bd89f151c4220d35/FLAG944c2f822 [2018-11-14 18:32:49,094 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:32:49,094 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bhmr2007_true-unreach-call_true-termination.c.i [2018-11-14 18:32:49,100 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a895071c3/e63a3470c6f24a58bd89f151c4220d35/FLAG944c2f822 [2018-11-14 18:32:49,114 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a895071c3/e63a3470c6f24a58bd89f151c4220d35 [2018-11-14 18:32:49,126 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:32:49,127 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:32:49,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:32:49,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:32:49,132 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:32:49,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:32:49" (1/1) ... [2018-11-14 18:32:49,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3245e527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:32:49, skipping insertion in model container [2018-11-14 18:32:49,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:32:49" (1/1) ... [2018-11-14 18:32:49,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:32:49,171 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:32:49,392 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:32:49,397 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:32:49,419 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:32:49,436 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:32:49,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:32:49 WrapperNode [2018-11-14 18:32:49,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:32:49,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:32:49,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:32:49,438 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:32:49,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:32:49" (1/1) ... [2018-11-14 18:32:49,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:32:49" (1/1) ... [2018-11-14 18:32:49,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:32:49" (1/1) ... [2018-11-14 18:32:49,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:32:49" (1/1) ... [2018-11-14 18:32:49,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:32:49" (1/1) ... [2018-11-14 18:32:49,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:32:49" (1/1) ... [2018-11-14 18:32:49,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:32:49" (1/1) ... [2018-11-14 18:32:49,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:32:49,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:32:49,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:32:49,487 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:32:49,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:32:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:32:49,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:32:49,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:32:49,623 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:32:49,623 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:32:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:32:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 18:32:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:32:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:32:49,624 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:32:49,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:32:49,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:32:50,180 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:32:50,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:32:50 BoogieIcfgContainer [2018-11-14 18:32:50,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:32:50,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:32:50,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:32:50,185 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:32:50,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:32:49" (1/3) ... [2018-11-14 18:32:50,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff9b9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:32:50, skipping insertion in model container [2018-11-14 18:32:50,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:32:49" (2/3) ... [2018-11-14 18:32:50,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff9b9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:32:50, skipping insertion in model container [2018-11-14 18:32:50,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:32:50" (3/3) ... [2018-11-14 18:32:50,189 INFO L112 eAbstractionObserver]: Analyzing ICFG bhmr2007_true-unreach-call_true-termination.c.i [2018-11-14 18:32:50,200 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:32:50,210 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:32:50,228 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:32:50,260 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:32:50,261 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:32:50,261 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:32:50,261 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:32:50,261 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:32:50,261 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:32:50,261 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:32:50,262 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:32:50,262 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:32:50,284 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-14 18:32:50,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 18:32:50,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:32:50,292 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:32:50,296 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:32:50,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:32:50,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1421497933, now seen corresponding path program 1 times [2018-11-14 18:32:50,305 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:32:50,306 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-14 18:32:50,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:32:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:50,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:32:50,437 INFO L256 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2018-11-14 18:32:50,441 INFO L273 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2018-11-14 18:32:50,441 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #44#return; {25#true} is VALID [2018-11-14 18:32:50,442 INFO L256 TraceCheckUtils]: 3: Hoare triple {25#true} call #t~ret3 := main(); {25#true} is VALID [2018-11-14 18:32:50,442 INFO L273 TraceCheckUtils]: 4: Hoare triple {25#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {25#true} is VALID [2018-11-14 18:32:50,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#true} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {25#true} is VALID [2018-11-14 18:32:50,450 INFO L273 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2018-11-14 18:32:50,450 INFO L256 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {26#false} is VALID [2018-11-14 18:32:50,450 INFO L273 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2018-11-14 18:32:50,451 INFO L273 TraceCheckUtils]: 9: Hoare triple {26#false} assume ~cond == 0bv32; {26#false} is VALID [2018-11-14 18:32:50,451 INFO L273 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2018-11-14 18:32:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:32:50,454 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:32:50,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:32:50,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:32:50,463 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 18:32:50,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:32:50,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:32:50,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:50,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:32:50,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:32:50,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:32:50,517 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-14 18:32:50,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:50,680 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-14 18:32:50,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:32:50,680 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-14 18:32:50,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:32:50,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:32:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2018-11-14 18:32:50,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:32:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2018-11-14 18:32:50,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 39 transitions. [2018-11-14 18:32:50,877 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:50,893 INFO L225 Difference]: With dead ends: 34 [2018-11-14 18:32:50,893 INFO L226 Difference]: Without dead ends: 15 [2018-11-14 18:32:50,897 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:32:50,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-14 18:32:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-14 18:32:51,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:32:51,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-14 18:32:51,029 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 18:32:51,029 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 18:32:51,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:51,033 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-14 18:32:51,033 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-14 18:32:51,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:51,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:51,036 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-14 18:32:51,036 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-14 18:32:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:51,039 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-14 18:32:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-14 18:32:51,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:51,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:51,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:32:51,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:32:51,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:32:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-14 18:32:51,050 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2018-11-14 18:32:51,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:32:51,050 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-14 18:32:51,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:32:51,050 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-14 18:32:51,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 18:32:51,051 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:32:51,051 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:32:51,052 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:32:51,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:32:51,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1574385422, now seen corresponding path program 1 times [2018-11-14 18:32:51,052 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:32:51,053 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-14 18:32:51,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:32:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:51,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:32:51,423 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-14 18:32:51,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {154#true} call ULTIMATE.init(); {154#true} is VALID [2018-11-14 18:32:51,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID [2018-11-14 18:32:51,614 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {154#true} {154#true} #44#return; {154#true} is VALID [2018-11-14 18:32:51,614 INFO L256 TraceCheckUtils]: 3: Hoare triple {154#true} call #t~ret3 := main(); {154#true} is VALID [2018-11-14 18:32:51,624 INFO L273 TraceCheckUtils]: 4: Hoare triple {154#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {171#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:51,637 INFO L273 TraceCheckUtils]: 5: Hoare triple {171#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {175#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:51,647 INFO L273 TraceCheckUtils]: 6: Hoare triple {175#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume true; {175#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:51,648 INFO L273 TraceCheckUtils]: 7: Hoare triple {175#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~i~0, ~n~0); {182#(and (not (bvslt (_ bv0 32) main_~n~0)) (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:51,651 INFO L256 TraceCheckUtils]: 8: Hoare triple {182#(and (not (bvslt (_ bv0 32) main_~n~0)) (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {186#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:32:51,652 INFO L273 TraceCheckUtils]: 9: Hoare triple {186#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {190#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:32:51,657 INFO L273 TraceCheckUtils]: 10: Hoare triple {190#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {155#false} is VALID [2018-11-14 18:32:51,657 INFO L273 TraceCheckUtils]: 11: Hoare triple {155#false} assume !false; {155#false} is VALID [2018-11-14 18:32:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:32:51,660 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:32:51,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:32:51,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 18:32:51,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-11-14 18:32:51,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:32:51,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:32:51,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:51,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:32:51,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:32:51,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:32:51,698 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2018-11-14 18:32:52,358 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-11-14 18:32:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:52,630 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-14 18:32:52,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:32:52,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-11-14 18:32:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:32:52,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:32:52,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-11-14 18:32:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:32:52,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2018-11-14 18:32:52,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 25 transitions. [2018-11-14 18:32:52,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:52,721 INFO L225 Difference]: With dead ends: 23 [2018-11-14 18:32:52,721 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 18:32:52,722 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:32:52,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 18:32:52,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-14 18:32:52,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:32:52,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2018-11-14 18:32:52,749 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2018-11-14 18:32:52,750 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2018-11-14 18:32:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:52,752 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-14 18:32:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-14 18:32:52,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:52,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:52,753 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2018-11-14 18:32:52,753 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2018-11-14 18:32:52,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:52,756 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-14 18:32:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-14 18:32:52,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:52,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:52,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:32:52,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:32:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:32:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-14 18:32:52,762 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2018-11-14 18:32:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:32:52,762 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-14 18:32:52,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:32:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-14 18:32:52,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 18:32:52,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:32:52,763 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:32:52,763 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:32:52,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:32:52,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1592010396, now seen corresponding path program 1 times [2018-11-14 18:32:52,764 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:32:52,765 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-14 18:32:52,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:32:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:52,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:32:53,335 INFO L256 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {294#true} is VALID [2018-11-14 18:32:53,335 INFO L273 TraceCheckUtils]: 1: Hoare triple {294#true} assume true; {294#true} is VALID [2018-11-14 18:32:53,336 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {294#true} {294#true} #44#return; {294#true} is VALID [2018-11-14 18:32:53,336 INFO L256 TraceCheckUtils]: 3: Hoare triple {294#true} call #t~ret3 := main(); {294#true} is VALID [2018-11-14 18:32:53,337 INFO L273 TraceCheckUtils]: 4: Hoare triple {294#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {311#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:53,337 INFO L273 TraceCheckUtils]: 5: Hoare triple {311#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {315#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:53,343 INFO L273 TraceCheckUtils]: 6: Hoare triple {315#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume true; {315#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:53,344 INFO L273 TraceCheckUtils]: 7: Hoare triple {315#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0); {322#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 18:32:53,344 INFO L273 TraceCheckUtils]: 8: Hoare triple {322#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume #t~nondet2 != 0bv32;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {326#(and (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 18:32:53,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {326#(and (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {330#(and (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:53,346 INFO L273 TraceCheckUtils]: 10: Hoare triple {330#(and (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {330#(and (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:53,348 INFO L273 TraceCheckUtils]: 11: Hoare triple {330#(and (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt (_ bv0 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~n~0); {337#(and (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (_ bv1 32) main_~n~0)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} is VALID [2018-11-14 18:32:53,350 INFO L256 TraceCheckUtils]: 12: Hoare triple {337#(and (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (_ bv1 32) main_~n~0)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvslt (_ bv0 32) main_~n~0))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {341#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:32:53,351 INFO L273 TraceCheckUtils]: 13: Hoare triple {341#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {345#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:32:53,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {345#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {295#false} is VALID [2018-11-14 18:32:53,352 INFO L273 TraceCheckUtils]: 15: Hoare triple {295#false} assume !false; {295#false} is VALID [2018-11-14 18:32:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:32:53,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:32:55,962 INFO L273 TraceCheckUtils]: 15: Hoare triple {295#false} assume !false; {295#false} is VALID [2018-11-14 18:32:55,963 INFO L273 TraceCheckUtils]: 14: Hoare triple {355#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {295#false} is VALID [2018-11-14 18:32:55,964 INFO L273 TraceCheckUtils]: 13: Hoare triple {359#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {355#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 18:32:55,966 INFO L256 TraceCheckUtils]: 12: Hoare triple {363#(= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {359#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 18:32:55,968 INFO L273 TraceCheckUtils]: 11: Hoare triple {367#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {363#(= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0))} is VALID [2018-11-14 18:32:55,969 INFO L273 TraceCheckUtils]: 10: Hoare triple {367#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} assume true; {367#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 18:32:55,972 INFO L273 TraceCheckUtils]: 9: Hoare triple {374#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {367#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 18:32:56,923 INFO L273 TraceCheckUtils]: 8: Hoare triple {378#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} assume #t~nondet2 != 0bv32;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {374#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-14 18:32:56,925 INFO L273 TraceCheckUtils]: 7: Hoare triple {382#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0); {378#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} is VALID [2018-11-14 18:32:56,926 INFO L273 TraceCheckUtils]: 6: Hoare triple {382#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} assume true; {382#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} is VALID [2018-11-14 18:32:56,929 INFO L273 TraceCheckUtils]: 5: Hoare triple {389#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvsge main_~n~0 (_ bv0 32))) (not (bvslt main_~i~0 main_~n~0)) (not (bvsle main_~n~0 (_ bv1000000 32))) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0))))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {382#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} is VALID [2018-11-14 18:32:56,931 INFO L273 TraceCheckUtils]: 4: Hoare triple {294#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {389#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvsge main_~n~0 (_ bv0 32))) (not (bvslt main_~i~0 main_~n~0)) (not (bvsle main_~n~0 (_ bv1000000 32))) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0))))} is VALID [2018-11-14 18:32:56,932 INFO L256 TraceCheckUtils]: 3: Hoare triple {294#true} call #t~ret3 := main(); {294#true} is VALID [2018-11-14 18:32:56,932 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {294#true} {294#true} #44#return; {294#true} is VALID [2018-11-14 18:32:56,933 INFO L273 TraceCheckUtils]: 1: Hoare triple {294#true} assume true; {294#true} is VALID [2018-11-14 18:32:56,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {294#true} is VALID [2018-11-14 18:32:56,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:32:56,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:32:56,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-14 18:32:56,939 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2018-11-14 18:32:56,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:32:56,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 18:32:57,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:57,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 18:32:57,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 18:32:57,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:32:57,837 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 18 states. [2018-11-14 18:32:59,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:59,480 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-14 18:32:59,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 18:32:59,480 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2018-11-14 18:32:59,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:32:59,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:32:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 35 transitions. [2018-11-14 18:32:59,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:32:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 35 transitions. [2018-11-14 18:32:59,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 35 transitions. [2018-11-14 18:32:59,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:59,560 INFO L225 Difference]: With dead ends: 31 [2018-11-14 18:32:59,561 INFO L226 Difference]: Without dead ends: 25 [2018-11-14 18:32:59,562 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2018-11-14 18:32:59,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-14 18:32:59,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-14 18:32:59,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:32:59,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-14 18:32:59,585 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 18:32:59,585 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 18:32:59,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:59,589 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-14 18:32:59,589 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-14 18:32:59,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:59,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:59,590 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-14 18:32:59,590 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-14 18:32:59,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:59,592 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-14 18:32:59,592 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-14 18:32:59,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:59,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:59,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:32:59,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:32:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:32:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-14 18:32:59,596 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2018-11-14 18:32:59,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:32:59,596 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-14 18:32:59,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 18:32:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-14 18:32:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 18:32:59,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:32:59,598 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:32:59,598 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:32:59,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:32:59,598 INFO L82 PathProgramCache]: Analyzing trace with hash 2103962116, now seen corresponding path program 1 times [2018-11-14 18:32:59,599 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:32:59,599 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-14 18:32:59,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:32:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:59,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:33:00,250 INFO L256 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2018-11-14 18:33:00,250 INFO L273 TraceCheckUtils]: 1: Hoare triple {546#true} assume true; {546#true} is VALID [2018-11-14 18:33:00,251 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {546#true} {546#true} #44#return; {546#true} is VALID [2018-11-14 18:33:00,251 INFO L256 TraceCheckUtils]: 3: Hoare triple {546#true} call #t~ret3 := main(); {546#true} is VALID [2018-11-14 18:33:00,259 INFO L273 TraceCheckUtils]: 4: Hoare triple {546#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {563#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 18:33:00,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {563#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {567#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:00,261 INFO L273 TraceCheckUtils]: 6: Hoare triple {567#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume true; {567#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:00,263 INFO L273 TraceCheckUtils]: 7: Hoare triple {567#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0); {567#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:00,265 INFO L273 TraceCheckUtils]: 8: Hoare triple {567#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2;~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(1bv32, ~b~0); {577#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:00,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {577#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {581#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:33:00,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {581#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {581#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:33:00,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {581#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0); {588#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:33:00,269 INFO L273 TraceCheckUtils]: 12: Hoare triple {588#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume #t~nondet2 != 0bv32;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {592#(and (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:33:00,270 INFO L273 TraceCheckUtils]: 13: Hoare triple {592#(and (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {596#(and (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:00,271 INFO L273 TraceCheckUtils]: 14: Hoare triple {596#(and (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume true; {596#(and (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:00,272 INFO L273 TraceCheckUtils]: 15: Hoare triple {596#(and (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~i~0, ~n~0); {603#(and (not (bvslt (_ bv2 32) main_~n~0)) (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 18:33:00,274 INFO L256 TraceCheckUtils]: 16: Hoare triple {603#(and (not (bvslt (_ bv2 32) main_~n~0)) (= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~b~0 (_ bv4294967293 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {607#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:33:00,275 INFO L273 TraceCheckUtils]: 17: Hoare triple {607#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {611#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:33:00,276 INFO L273 TraceCheckUtils]: 18: Hoare triple {611#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {547#false} is VALID [2018-11-14 18:33:00,277 INFO L273 TraceCheckUtils]: 19: Hoare triple {547#false} assume !false; {547#false} is VALID [2018-11-14 18:33:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:33:00,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:33:05,289 INFO L273 TraceCheckUtils]: 19: Hoare triple {547#false} assume !false; {547#false} is VALID [2018-11-14 18:33:05,289 INFO L273 TraceCheckUtils]: 18: Hoare triple {621#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {547#false} is VALID [2018-11-14 18:33:05,292 INFO L273 TraceCheckUtils]: 17: Hoare triple {625#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {621#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 18:33:05,293 INFO L256 TraceCheckUtils]: 16: Hoare triple {629#(= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {625#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 18:33:05,295 INFO L273 TraceCheckUtils]: 15: Hoare triple {633#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {629#(= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0))} is VALID [2018-11-14 18:33:05,297 INFO L273 TraceCheckUtils]: 14: Hoare triple {633#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} assume true; {633#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 18:33:05,299 INFO L273 TraceCheckUtils]: 13: Hoare triple {640#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {633#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 18:33:05,840 INFO L273 TraceCheckUtils]: 12: Hoare triple {644#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} assume #t~nondet2 != 0bv32;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {640#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-14 18:33:05,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {648#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0); {644#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-14 18:33:05,843 INFO L273 TraceCheckUtils]: 10: Hoare triple {648#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} assume true; {648#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-14 18:33:05,884 INFO L273 TraceCheckUtils]: 9: Hoare triple {655#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {648#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-14 18:33:06,684 INFO L273 TraceCheckUtils]: 8: Hoare triple {659#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2;~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(1bv32, ~b~0); {655#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-14 18:33:06,685 INFO L273 TraceCheckUtils]: 7: Hoare triple {659#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} assume !!~bvslt32(~i~0, ~n~0); {659#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-14 18:33:06,685 INFO L273 TraceCheckUtils]: 6: Hoare triple {659#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} assume true; {659#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-14 18:33:06,689 INFO L273 TraceCheckUtils]: 5: Hoare triple {669#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsge main_~n~0 (_ bv0 32))) (not (bvsle main_~n~0 (_ bv1000000 32)))))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {659#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-14 18:33:06,691 INFO L273 TraceCheckUtils]: 4: Hoare triple {546#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {669#(forall ((main_~n~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (not (bvsge main_~n~0 (_ bv0 32))) (not (bvsle main_~n~0 (_ bv1000000 32)))))} is VALID [2018-11-14 18:33:06,691 INFO L256 TraceCheckUtils]: 3: Hoare triple {546#true} call #t~ret3 := main(); {546#true} is VALID [2018-11-14 18:33:06,691 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {546#true} {546#true} #44#return; {546#true} is VALID [2018-11-14 18:33:06,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {546#true} assume true; {546#true} is VALID [2018-11-14 18:33:06,692 INFO L256 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2018-11-14 18:33:06,694 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:33:06,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:33:06,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-14 18:33:06,699 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 20 [2018-11-14 18:33:06,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:33:06,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 18:33:08,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:33:08,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 18:33:08,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 18:33:08,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:33:08,691 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 22 states. [2018-11-14 18:33:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:33:13,078 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-14 18:33:13,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 18:33:13,079 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 20 [2018-11-14 18:33:13,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:33:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:33:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 46 transitions. [2018-11-14 18:33:13,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:33:13,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 46 transitions. [2018-11-14 18:33:13,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 46 transitions. [2018-11-14 18:33:14,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:33:14,443 INFO L225 Difference]: With dead ends: 46 [2018-11-14 18:33:14,443 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 18:33:14,444 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2018-11-14 18:33:14,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 18:33:14,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2018-11-14 18:33:14,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:33:14,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 33 states. [2018-11-14 18:33:14,479 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 33 states. [2018-11-14 18:33:14,480 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 33 states. [2018-11-14 18:33:14,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:33:14,482 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-14 18:33:14,483 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-14 18:33:14,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:33:14,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:33:14,483 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 40 states. [2018-11-14 18:33:14,484 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 40 states. [2018-11-14 18:33:14,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:33:14,486 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-14 18:33:14,486 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-14 18:33:14,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:33:14,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:33:14,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:33:14,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:33:14,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:33:14,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-14 18:33:14,489 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 20 [2018-11-14 18:33:14,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:33:14,490 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-14 18:33:14,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 18:33:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 18:33:14,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 18:33:14,491 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:33:14,491 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:33:14,491 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:33:14,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:33:14,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1853574416, now seen corresponding path program 2 times [2018-11-14 18:33:14,492 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:33:14,492 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:33:14,509 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:33:14,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:33:14,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:33:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:33:14,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:33:15,631 INFO L256 TraceCheckUtils]: 0: Hoare triple {895#true} call ULTIMATE.init(); {895#true} is VALID [2018-11-14 18:33:15,632 INFO L273 TraceCheckUtils]: 1: Hoare triple {895#true} assume true; {895#true} is VALID [2018-11-14 18:33:15,632 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {895#true} {895#true} #44#return; {895#true} is VALID [2018-11-14 18:33:15,632 INFO L256 TraceCheckUtils]: 3: Hoare triple {895#true} call #t~ret3 := main(); {895#true} is VALID [2018-11-14 18:33:15,633 INFO L273 TraceCheckUtils]: 4: Hoare triple {895#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {912#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 18:33:15,633 INFO L273 TraceCheckUtils]: 5: Hoare triple {912#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {916#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:15,634 INFO L273 TraceCheckUtils]: 6: Hoare triple {916#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume true; {916#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:15,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {916#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0); {916#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:15,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {916#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume #t~nondet2 != 0bv32;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {926#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:15,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {926#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {930#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:33:15,642 INFO L273 TraceCheckUtils]: 10: Hoare triple {930#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {930#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:33:15,643 INFO L273 TraceCheckUtils]: 11: Hoare triple {930#(and (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0); {937#(and (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:33:15,645 INFO L273 TraceCheckUtils]: 12: Hoare triple {937#(and (= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume #t~nondet2 != 0bv32;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {941#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:33:15,647 INFO L273 TraceCheckUtils]: 13: Hoare triple {941#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {945#(and (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:15,647 INFO L273 TraceCheckUtils]: 14: Hoare triple {945#(and (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume true; {945#(and (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:15,648 INFO L273 TraceCheckUtils]: 15: Hoare triple {945#(and (bvslt (_ bv1 32) main_~n~0) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0); {952#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 18:33:15,650 INFO L273 TraceCheckUtils]: 16: Hoare triple {952#(and (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume #t~nondet2 != 0bv32;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {956#(and (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv3 32) main_~a~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 18:33:15,652 INFO L273 TraceCheckUtils]: 17: Hoare triple {956#(and (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv3 32) main_~a~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {960#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv3 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:15,653 INFO L273 TraceCheckUtils]: 18: Hoare triple {960#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv3 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)))} assume true; {960#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv3 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:15,655 INFO L273 TraceCheckUtils]: 19: Hoare triple {960#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv3 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~i~0, ~n~0); {967#(and (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (bvslt (_ bv2 32) main_~n~0) (= (_ bv3 32) main_~a~0) (not (bvslt (_ bv3 32) main_~n~0)))} is VALID [2018-11-14 18:33:15,657 INFO L256 TraceCheckUtils]: 20: Hoare triple {967#(and (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (bvslt (_ bv2 32) main_~n~0) (= (_ bv3 32) main_~a~0) (not (bvslt (_ bv3 32) main_~n~0)))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {971#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:33:15,658 INFO L273 TraceCheckUtils]: 21: Hoare triple {971#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {975#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:33:15,659 INFO L273 TraceCheckUtils]: 22: Hoare triple {975#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {896#false} is VALID [2018-11-14 18:33:15,659 INFO L273 TraceCheckUtils]: 23: Hoare triple {896#false} assume !false; {896#false} is VALID [2018-11-14 18:33:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:33:15,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:33:23,552 INFO L273 TraceCheckUtils]: 23: Hoare triple {896#false} assume !false; {896#false} is VALID [2018-11-14 18:33:23,553 INFO L273 TraceCheckUtils]: 22: Hoare triple {985#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {896#false} is VALID [2018-11-14 18:33:23,569 INFO L273 TraceCheckUtils]: 21: Hoare triple {989#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {985#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 18:33:23,570 INFO L256 TraceCheckUtils]: 20: Hoare triple {993#(= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {989#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 18:33:23,570 INFO L273 TraceCheckUtils]: 19: Hoare triple {997#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {993#(= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0))} is VALID [2018-11-14 18:33:23,571 INFO L273 TraceCheckUtils]: 18: Hoare triple {997#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} assume true; {997#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 18:33:23,573 INFO L273 TraceCheckUtils]: 17: Hoare triple {1004#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {997#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 18:33:24,457 INFO L273 TraceCheckUtils]: 16: Hoare triple {1008#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} assume #t~nondet2 != 0bv32;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1004#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-14 18:33:24,460 INFO L273 TraceCheckUtils]: 15: Hoare triple {1012#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0); {1008#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-14 18:33:24,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {1012#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} assume true; {1012#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-14 18:33:24,493 INFO L273 TraceCheckUtils]: 13: Hoare triple {1019#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1012#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-14 18:33:25,474 INFO L273 TraceCheckUtils]: 12: Hoare triple {1023#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} assume #t~nondet2 != 0bv32;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1019#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967293 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)))} is VALID [2018-11-14 18:33:25,476 INFO L273 TraceCheckUtils]: 11: Hoare triple {1027#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt main_~i~0 main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0); {1023#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-14 18:33:25,477 INFO L273 TraceCheckUtils]: 10: Hoare triple {1027#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt main_~i~0 main_~n~0)))} assume true; {1027#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-14 18:33:25,575 INFO L273 TraceCheckUtils]: 9: Hoare triple {1034#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1027#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt main_~i~0 main_~n~0)))} is VALID [2018-11-14 18:33:26,796 INFO L273 TraceCheckUtils]: 8: Hoare triple {1038#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} assume #t~nondet2 != 0bv32;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1034#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-14 18:33:26,797 INFO L273 TraceCheckUtils]: 7: Hoare triple {1038#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0); {1038#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-14 18:33:26,798 INFO L273 TraceCheckUtils]: 6: Hoare triple {1038#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} assume true; {1038#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-14 18:33:26,802 INFO L273 TraceCheckUtils]: 5: Hoare triple {1048#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (not (bvsge main_~n~0 (_ bv0 32))) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvsle main_~n~0 (_ bv1000000 32))) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {1038#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-14 18:33:26,803 INFO L273 TraceCheckUtils]: 4: Hoare triple {895#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1048#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (not (bvsge main_~n~0 (_ bv0 32))) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvsle main_~n~0 (_ bv1000000 32))) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)))} is VALID [2018-11-14 18:33:26,804 INFO L256 TraceCheckUtils]: 3: Hoare triple {895#true} call #t~ret3 := main(); {895#true} is VALID [2018-11-14 18:33:26,804 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {895#true} {895#true} #44#return; {895#true} is VALID [2018-11-14 18:33:26,804 INFO L273 TraceCheckUtils]: 1: Hoare triple {895#true} assume true; {895#true} is VALID [2018-11-14 18:33:26,804 INFO L256 TraceCheckUtils]: 0: Hoare triple {895#true} call ULTIMATE.init(); {895#true} is VALID [2018-11-14 18:33:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:33:26,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:33:26,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-14 18:33:26,810 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 24 [2018-11-14 18:33:26,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:33:26,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-14 18:33:29,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:33:29,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-14 18:33:29,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-14 18:33:29,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2018-11-14 18:33:29,716 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 28 states. [2018-11-14 18:33:30,857 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-14 18:33:39,391 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2018-11-14 18:33:40,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:33:40,316 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2018-11-14 18:33:40,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-14 18:33:40,317 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 24 [2018-11-14 18:33:40,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:33:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:33:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 57 transitions. [2018-11-14 18:33:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:33:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 57 transitions. [2018-11-14 18:33:40,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 57 transitions. [2018-11-14 18:33:46,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 56 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-14 18:33:46,896 INFO L225 Difference]: With dead ends: 72 [2018-11-14 18:33:46,896 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 18:33:46,897 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2018-11-14 18:33:46,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 18:33:47,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 45. [2018-11-14 18:33:47,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:33:47,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 45 states. [2018-11-14 18:33:47,058 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 45 states. [2018-11-14 18:33:47,058 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 45 states. [2018-11-14 18:33:47,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:33:47,062 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-11-14 18:33:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2018-11-14 18:33:47,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:33:47,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:33:47,063 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 66 states. [2018-11-14 18:33:47,064 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 66 states. [2018-11-14 18:33:47,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:33:47,067 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-11-14 18:33:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2018-11-14 18:33:47,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:33:47,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:33:47,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:33:47,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:33:47,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 18:33:47,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2018-11-14 18:33:47,071 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 24 [2018-11-14 18:33:47,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:33:47,071 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2018-11-14 18:33:47,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-14 18:33:47,071 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-11-14 18:33:47,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:33:47,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:33:47,072 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:33:47,073 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:33:47,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:33:47,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1668920810, now seen corresponding path program 2 times [2018-11-14 18:33:47,074 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:33:47,074 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 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 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:33:47,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:33:47,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:33:47,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:33:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:33:47,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:33:47,856 INFO L256 TraceCheckUtils]: 0: Hoare triple {1382#true} call ULTIMATE.init(); {1382#true} is VALID [2018-11-14 18:33:47,856 INFO L273 TraceCheckUtils]: 1: Hoare triple {1382#true} assume true; {1382#true} is VALID [2018-11-14 18:33:47,856 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1382#true} {1382#true} #44#return; {1382#true} is VALID [2018-11-14 18:33:47,856 INFO L256 TraceCheckUtils]: 3: Hoare triple {1382#true} call #t~ret3 := main(); {1382#true} is VALID [2018-11-14 18:33:47,859 INFO L273 TraceCheckUtils]: 4: Hoare triple {1382#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1399#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 18:33:47,861 INFO L273 TraceCheckUtils]: 5: Hoare triple {1399#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {1403#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:47,861 INFO L273 TraceCheckUtils]: 6: Hoare triple {1403#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume true; {1403#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:47,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {1403#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0); {1403#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:47,863 INFO L273 TraceCheckUtils]: 8: Hoare triple {1403#(and (= main_~b~0 (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2;~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(1bv32, ~b~0); {1413#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:47,864 INFO L273 TraceCheckUtils]: 9: Hoare triple {1413#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1417#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:33:47,864 INFO L273 TraceCheckUtils]: 10: Hoare triple {1417#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1417#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:33:47,865 INFO L273 TraceCheckUtils]: 11: Hoare triple {1417#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0); {1417#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:33:47,866 INFO L273 TraceCheckUtils]: 12: Hoare triple {1417#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2;~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(1bv32, ~b~0); {1427#(and (bvsge main_~n~0 (_ bv0 32)) (= (_ bv2 32) main_~b~0) (= (_ bv4 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:33:47,866 INFO L273 TraceCheckUtils]: 13: Hoare triple {1427#(and (bvsge main_~n~0 (_ bv0 32)) (= (_ bv2 32) main_~b~0) (= (_ bv4 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1431#(and (bvsge main_~n~0 (_ bv0 32)) (= (_ bv2 32) main_~b~0) (= (_ bv4 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 18:33:47,875 INFO L273 TraceCheckUtils]: 14: Hoare triple {1431#(and (bvsge main_~n~0 (_ bv0 32)) (= (_ bv2 32) main_~b~0) (= (_ bv4 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)) (= (_ bv2 32) main_~i~0))} assume true; {1431#(and (bvsge main_~n~0 (_ bv0 32)) (= (_ bv2 32) main_~b~0) (= (_ bv4 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 18:33:47,876 INFO L273 TraceCheckUtils]: 15: Hoare triple {1431#(and (bvsge main_~n~0 (_ bv0 32)) (= (_ bv2 32) main_~b~0) (= (_ bv4 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~n~0); {1431#(and (bvsge main_~n~0 (_ bv0 32)) (= (_ bv2 32) main_~b~0) (= (_ bv4 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 18:33:47,877 INFO L273 TraceCheckUtils]: 16: Hoare triple {1431#(and (bvsge main_~n~0 (_ bv0 32)) (= (_ bv2 32) main_~b~0) (= (_ bv4 32) main_~a~0) (bvsle main_~n~0 (_ bv1000000 32)) (= (_ bv2 32) main_~i~0))} assume #t~nondet2 != 0bv32;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1441#(and (= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 18:33:47,878 INFO L273 TraceCheckUtils]: 17: Hoare triple {1441#(and (= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (= (_ bv2 32) main_~i~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1445#(and (= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:47,878 INFO L273 TraceCheckUtils]: 18: Hoare triple {1445#(and (= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume true; {1445#(and (= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:47,879 INFO L273 TraceCheckUtils]: 19: Hoare triple {1445#(and (= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32)) (bvsge main_~n~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvslt32(~i~0, ~n~0); {1452#(and (= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 18:33:47,880 INFO L273 TraceCheckUtils]: 20: Hoare triple {1452#(and (= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967292 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} assume #t~nondet2 != 0bv32;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1456#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 18:33:47,881 INFO L273 TraceCheckUtils]: 21: Hoare triple {1456#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvslt main_~i~0 main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1460#(and (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (bvslt (_ bv3 32) main_~n~0) (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:47,883 INFO L273 TraceCheckUtils]: 22: Hoare triple {1460#(and (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (bvslt (_ bv3 32) main_~n~0) (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume true; {1460#(and (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (bvslt (_ bv3 32) main_~n~0) (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:33:47,884 INFO L273 TraceCheckUtils]: 23: Hoare triple {1460#(and (= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32)) (bvslt (_ bv3 32) main_~n~0) (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !~bvslt32(~i~0, ~n~0); {1467#(and (bvslt (_ bv3 32) main_~n~0) (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (not (bvslt (_ bv4 32) main_~n~0)))} is VALID [2018-11-14 18:33:47,885 INFO L256 TraceCheckUtils]: 24: Hoare triple {1467#(and (bvslt (_ bv3 32) main_~n~0) (= (bvadd main_~b~0 (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32)) (not (bvslt (_ bv4 32) main_~n~0)))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {1471#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:33:47,886 INFO L273 TraceCheckUtils]: 25: Hoare triple {1471#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1475#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:33:47,886 INFO L273 TraceCheckUtils]: 26: Hoare triple {1475#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {1383#false} is VALID [2018-11-14 18:33:47,887 INFO L273 TraceCheckUtils]: 27: Hoare triple {1383#false} assume !false; {1383#false} is VALID [2018-11-14 18:33:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:33:47,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:33:56,945 INFO L273 TraceCheckUtils]: 27: Hoare triple {1383#false} assume !false; {1383#false} is VALID [2018-11-14 18:33:56,946 INFO L273 TraceCheckUtils]: 26: Hoare triple {1485#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {1383#false} is VALID [2018-11-14 18:33:56,947 INFO L273 TraceCheckUtils]: 25: Hoare triple {1489#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1485#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 18:33:56,949 INFO L256 TraceCheckUtils]: 24: Hoare triple {1493#(= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0))} call __VERIFIER_assert((if ~bvadd32(~a~0, ~b~0) == ~bvmul32(3bv32, ~n~0) then 1bv32 else 0bv32)); {1489#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 18:33:56,950 INFO L273 TraceCheckUtils]: 23: Hoare triple {1497#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} assume !~bvslt32(~i~0, ~n~0); {1493#(= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0))} is VALID [2018-11-14 18:33:56,950 INFO L273 TraceCheckUtils]: 22: Hoare triple {1497#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} assume true; {1497#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 18:33:56,954 INFO L273 TraceCheckUtils]: 21: Hoare triple {1504#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1497#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt main_~i~0 main_~n~0))} is VALID [2018-11-14 18:33:57,729 INFO L273 TraceCheckUtils]: 20: Hoare triple {1508#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} assume #t~nondet2 != 0bv32;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1504#(or (= (bvmul (_ bv3 32) main_~n~0) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0))} is VALID [2018-11-14 18:33:57,731 INFO L273 TraceCheckUtils]: 19: Hoare triple {1512#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} assume !!~bvslt32(~i~0, ~n~0); {1508#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} is VALID [2018-11-14 18:33:57,732 INFO L273 TraceCheckUtils]: 18: Hoare triple {1512#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} assume true; {1512#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} is VALID [2018-11-14 18:33:57,762 INFO L273 TraceCheckUtils]: 17: Hoare triple {1519#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1512#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvslt main_~i~0 main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} is VALID [2018-11-14 18:33:58,570 INFO L273 TraceCheckUtils]: 16: Hoare triple {1523#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} assume #t~nondet2 != 0bv32;havoc #t~nondet2;~a~0 := ~bvadd32(1bv32, ~a~0);~b~0 := ~bvadd32(2bv32, ~b~0); {1519#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv3 32)) (bvmul (_ bv3 32) main_~n~0)))} is VALID [2018-11-14 18:33:58,571 INFO L273 TraceCheckUtils]: 15: Hoare triple {1523#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} assume !!~bvslt32(~i~0, ~n~0); {1523#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-14 18:33:58,571 INFO L273 TraceCheckUtils]: 14: Hoare triple {1523#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} assume true; {1523#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-14 18:33:58,635 INFO L273 TraceCheckUtils]: 13: Hoare triple {1533#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1523#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)))} is VALID [2018-11-14 18:33:59,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {1537#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2;~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(1bv32, ~b~0); {1533#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967290 32)) (bvadd main_~a~0 main_~b~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-14 18:33:59,845 INFO L273 TraceCheckUtils]: 11: Hoare triple {1537#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0); {1537#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-14 18:33:59,845 INFO L273 TraceCheckUtils]: 10: Hoare triple {1537#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} assume true; {1537#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-14 18:33:59,930 INFO L273 TraceCheckUtils]: 9: Hoare triple {1547#(or (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1537#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0))} is VALID [2018-11-14 18:34:00,599 INFO L273 TraceCheckUtils]: 8: Hoare triple {1551#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967284 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} assume !(#t~nondet2 != 0bv32);havoc #t~nondet2;~a~0 := ~bvadd32(2bv32, ~a~0);~b~0 := ~bvadd32(1bv32, ~b~0); {1547#(or (= (bvadd main_~a~0 main_~b~0 (_ bv9 32)) (bvmul (_ bv3 32) main_~n~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} is VALID [2018-11-14 18:34:00,600 INFO L273 TraceCheckUtils]: 7: Hoare triple {1551#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967284 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} assume !!~bvslt32(~i~0, ~n~0); {1551#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967284 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} is VALID [2018-11-14 18:34:00,601 INFO L273 TraceCheckUtils]: 6: Hoare triple {1551#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967284 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} assume true; {1551#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967284 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} is VALID [2018-11-14 18:34:00,605 INFO L273 TraceCheckUtils]: 5: Hoare triple {1561#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvsge main_~n~0 (_ bv0 32))) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967284 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (not (bvsle main_~n~0 (_ bv1000000 32))) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)))} assume !!(~bvsge32(~n~0, 0bv32) && ~bvsle32(~n~0, 1000000bv32)); {1551#(or (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967284 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0))} is VALID [2018-11-14 18:34:00,606 INFO L273 TraceCheckUtils]: 4: Hoare triple {1382#true} havoc ~i~0;havoc ~n~0;havoc ~a~0;havoc ~b~0;~i~0 := 0bv32;~a~0 := 0bv32;~b~0 := 0bv32;~n~0 := #t~nondet1;havoc #t~nondet1; {1561#(forall ((main_~n~0 (_ BitVec 32))) (or (not (bvsge main_~n~0 (_ bv0 32))) (= (bvadd (bvmul (_ bv3 32) main_~n~0) (_ bv4294967284 32)) (bvadd main_~a~0 main_~b~0)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) main_~n~0)) (not (bvsle main_~n~0 (_ bv1000000 32))) (bvslt (bvadd main_~i~0 (_ bv4 32)) main_~n~0)))} is VALID [2018-11-14 18:34:00,607 INFO L256 TraceCheckUtils]: 3: Hoare triple {1382#true} call #t~ret3 := main(); {1382#true} is VALID [2018-11-14 18:34:00,607 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1382#true} {1382#true} #44#return; {1382#true} is VALID [2018-11-14 18:34:00,607 INFO L273 TraceCheckUtils]: 1: Hoare triple {1382#true} assume true; {1382#true} is VALID [2018-11-14 18:34:00,607 INFO L256 TraceCheckUtils]: 0: Hoare triple {1382#true} call ULTIMATE.init(); {1382#true} is VALID [2018-11-14 18:34:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:34:00,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:34:00,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-11-14 18:34:00,614 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 28 [2018-11-14 18:34:00,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:34:00,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 18:34:04,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:34:04,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 18:34:04,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 18:34:04,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-11-14 18:34:04,496 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 30 states. [2018-11-14 18:34:05,418 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-14 18:34:06,243 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-14 18:34:06,989 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-14 18:34:23,729 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 24 [2018-11-14 18:34:24,012 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2018-11-14 18:34:25,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:34:25,063 INFO L93 Difference]: Finished difference Result 112 states and 135 transitions. [2018-11-14 18:34:25,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-14 18:34:25,063 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 28 [2018-11-14 18:34:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:34:25,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:34:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 70 transitions. [2018-11-14 18:34:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:34:25,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 70 transitions. [2018-11-14 18:34:25,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 70 transitions. [2018-11-14 18:34:35,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 66 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2018-11-14 18:34:35,493 INFO L225 Difference]: With dead ends: 112 [2018-11-14 18:34:35,493 INFO L226 Difference]: Without dead ends: 104 [2018-11-14 18:34:35,495 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=402, Invalid=2460, Unknown=0, NotChecked=0, Total=2862 [2018-11-14 18:34:35,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-14 18:34:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 57. [2018-11-14 18:34:35,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:34:35,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand 57 states. [2018-11-14 18:34:35,729 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 57 states. [2018-11-14 18:34:35,730 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 57 states. [2018-11-14 18:34:35,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:34:35,735 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2018-11-14 18:34:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2018-11-14 18:34:35,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:34:35,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:34:35,736 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 104 states. [2018-11-14 18:34:35,736 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 104 states. [2018-11-14 18:34:35,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:34:35,741 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2018-11-14 18:34:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2018-11-14 18:34:35,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:34:35,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:34:35,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:34:35,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:34:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-14 18:34:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-11-14 18:34:35,744 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 28 [2018-11-14 18:34:35,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:34:35,745 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-11-14 18:34:35,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 18:34:35,745 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-11-14 18:34:35,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 18:34:35,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:34:35,746 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:34:35,746 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:34:35,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:34:35,746 INFO L82 PathProgramCache]: Analyzing trace with hash 110188546, now seen corresponding path program 3 times [2018-11-14 18:34:35,747 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:34:35,747 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:34:35,768 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 18:34:35,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-14 18:34:35,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:34:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:34:35,938 INFO L273 TraceCheckSpWp]: Computing forward predicates...