java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-lit/afnp2014_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:37:18,348 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:37:18,351 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:37:18,368 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:37:18,368 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:37:18,370 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:37:18,371 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:37:18,374 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:37:18,377 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:37:18,378 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:37:18,381 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:37:18,381 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:37:18,383 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:37:18,390 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:37:18,392 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:37:18,392 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:37:18,397 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:37:18,404 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:37:18,406 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:37:18,407 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:37:18,408 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:37:18,410 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:37:18,412 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:37:18,412 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:37:18,414 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:37:18,415 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:37:18,416 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:37:18,419 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:37:18,420 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:37:18,421 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:37:18,421 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:37:18,423 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:37:18,423 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:37:18,423 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:37:18,424 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:37:18,426 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:37:18,426 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:37:18,456 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:37:18,456 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:37:18,458 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:37:18,458 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:37:18,459 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:37:18,459 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:37:18,459 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:37:18,460 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:37:18,461 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:37:18,461 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:37:18,461 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:37:18,461 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:37:18,461 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:37:18,462 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:37:18,462 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:37:18,462 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:37:18,462 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:37:18,462 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:37:18,463 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:37:18,463 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:37:18,463 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:37:18,463 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:37:18,463 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:37:18,464 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:37:18,464 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:37:18,464 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:37:18,464 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:37:18,464 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:37:18,465 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:37:18,465 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:37:18,465 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:37:18,465 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:37:18,465 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:37:18,533 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:37:18,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:37:18,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:37:18,557 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:37:18,558 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:37:18,559 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/afnp2014_true-unreach-call_true-termination.c.i [2018-11-23 11:37:18,628 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f71a78d5b/adcf1cb9373a430ea81511d82ed2d8f8/FLAGbcacd5244 [2018-11-23 11:37:19,067 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:37:19,067 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/afnp2014_true-unreach-call_true-termination.c.i [2018-11-23 11:37:19,073 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f71a78d5b/adcf1cb9373a430ea81511d82ed2d8f8/FLAGbcacd5244 [2018-11-23 11:37:19,424 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f71a78d5b/adcf1cb9373a430ea81511d82ed2d8f8 [2018-11-23 11:37:19,435 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:37:19,436 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:37:19,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:37:19,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:37:19,442 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:37:19,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:37:19" (1/1) ... [2018-11-23 11:37:19,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eec3e02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:19, skipping insertion in model container [2018-11-23 11:37:19,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:37:19" (1/1) ... [2018-11-23 11:37:19,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:37:19,485 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:37:19,710 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:37:19,715 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:37:19,731 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:37:19,746 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:37:19,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:19 WrapperNode [2018-11-23 11:37:19,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:37:19,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:37:19,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:37:19,748 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:37:19,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:19" (1/1) ... [2018-11-23 11:37:19,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:19" (1/1) ... [2018-11-23 11:37:19,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:37:19,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:37:19,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:37:19,771 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:37:19,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:19" (1/1) ... [2018-11-23 11:37:19,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:19" (1/1) ... [2018-11-23 11:37:19,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:19" (1/1) ... [2018-11-23 11:37:19,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:19" (1/1) ... [2018-11-23 11:37:19,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:19" (1/1) ... [2018-11-23 11:37:19,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:19" (1/1) ... [2018-11-23 11:37:19,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:19" (1/1) ... [2018-11-23 11:37:19,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:37:19,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:37:19,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:37:19,805 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:37:19,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:37:19,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:37:19,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:37:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:37:19,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:37:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:37:19,928 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:37:19,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:37:19,928 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:37:20,320 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:37:20,320 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:37:20,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:37:20 BoogieIcfgContainer [2018-11-23 11:37:20,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:37:20,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:37:20,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:37:20,326 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:37:20,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:37:19" (1/3) ... [2018-11-23 11:37:20,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1f3022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:37:20, skipping insertion in model container [2018-11-23 11:37:20,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:37:19" (2/3) ... [2018-11-23 11:37:20,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1f3022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:37:20, skipping insertion in model container [2018-11-23 11:37:20,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:37:20" (3/3) ... [2018-11-23 11:37:20,331 INFO L112 eAbstractionObserver]: Analyzing ICFG afnp2014_true-unreach-call_true-termination.c.i [2018-11-23 11:37:20,340 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:37:20,348 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:37:20,365 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:37:20,399 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:37:20,400 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:37:20,400 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:37:20,400 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:37:20,401 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:37:20,401 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:37:20,401 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:37:20,401 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:37:20,401 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:37:20,420 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 11:37:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:37:20,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:20,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:20,430 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:20,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:20,436 INFO L82 PathProgramCache]: Analyzing trace with hash -14991171, now seen corresponding path program 1 times [2018-11-23 11:37:20,440 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:20,440 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:20,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:20,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:20,728 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-23 11:37:20,732 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-23 11:37:20,732 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2018-11-23 11:37:20,733 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret2 := main(); {21#true} is VALID [2018-11-23 11:37:20,738 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~x~0 := 1bv32;~y~0 := 0bv32; {38#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:37:20,739 INFO L273 TraceCheckUtils]: 5: Hoare triple {38#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} assume !(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1; {38#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:37:20,747 INFO L256 TraceCheckUtils]: 6: Hoare triple {38#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvsge32(~x~0, ~y~0) then 1bv32 else 0bv32)); {45#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:20,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {45#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {49#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:20,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {49#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {22#false} is VALID [2018-11-23 11:37:20,750 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-23 11:37:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:20,754 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:37:20,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:37:20,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:37:20,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:37:20,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:20,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:37:20,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:20,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:37:20,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:37:20,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:37:20,896 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2018-11-23 11:37:21,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:21,431 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 11:37:21,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:37:21,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:37:21,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:21,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:37:21,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-23 11:37:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:37:21,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-23 11:37:21,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2018-11-23 11:37:21,645 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-23 11:37:21,658 INFO L225 Difference]: With dead ends: 39 [2018-11-23 11:37:21,658 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 11:37:21,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:37:21,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 11:37:21,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 11:37:21,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:21,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 11:37:21,714 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:37:21,714 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:37:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:21,717 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:37:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:37:21,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:21,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:21,718 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:37:21,718 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:37:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:21,723 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:37:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:37:21,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:21,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:21,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:21,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:21,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:37:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 11:37:21,729 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 11:37:21,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:21,729 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 11:37:21,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:37:21,730 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:37:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:37:21,730 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:21,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:21,731 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:21,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:21,731 INFO L82 PathProgramCache]: Analyzing trace with hash -429188558, now seen corresponding path program 1 times [2018-11-23 11:37:21,732 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:21,732 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:21,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:37:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:21,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:22,443 INFO L256 TraceCheckUtils]: 0: Hoare triple {152#true} call ULTIMATE.init(); {152#true} is VALID [2018-11-23 11:37:22,444 INFO L273 TraceCheckUtils]: 1: Hoare triple {152#true} assume true; {152#true} is VALID [2018-11-23 11:37:22,444 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {152#true} {152#true} #32#return; {152#true} is VALID [2018-11-23 11:37:22,445 INFO L256 TraceCheckUtils]: 3: Hoare triple {152#true} call #t~ret2 := main(); {152#true} is VALID [2018-11-23 11:37:22,457 INFO L273 TraceCheckUtils]: 4: Hoare triple {152#true} ~x~0 := 1bv32;~y~0 := 0bv32; {169#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:37:22,471 INFO L273 TraceCheckUtils]: 5: Hoare triple {169#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {173#(and (= (bvadd main_~y~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:37:22,484 INFO L273 TraceCheckUtils]: 6: Hoare triple {173#(and (= (bvadd main_~y~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1; {173#(and (= (bvadd main_~y~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:37:22,493 INFO L256 TraceCheckUtils]: 7: Hoare triple {173#(and (= (bvadd main_~y~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsge32(~x~0, ~y~0) then 1bv32 else 0bv32)); {180#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:22,506 INFO L273 TraceCheckUtils]: 8: Hoare triple {180#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {184#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:22,519 INFO L273 TraceCheckUtils]: 9: Hoare triple {184#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {153#false} is VALID [2018-11-23 11:37:22,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {153#false} assume !false; {153#false} is VALID [2018-11-23 11:37:22,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:22,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:22,858 INFO L273 TraceCheckUtils]: 10: Hoare triple {153#false} assume !false; {153#false} is VALID [2018-11-23 11:37:22,860 INFO L273 TraceCheckUtils]: 9: Hoare triple {194#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {153#false} is VALID [2018-11-23 11:37:22,865 INFO L273 TraceCheckUtils]: 8: Hoare triple {198#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {194#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:37:22,866 INFO L256 TraceCheckUtils]: 7: Hoare triple {202#(bvsge main_~x~0 main_~y~0)} call __VERIFIER_assert((if ~bvsge32(~x~0, ~y~0) then 1bv32 else 0bv32)); {198#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:37:22,867 INFO L273 TraceCheckUtils]: 6: Hoare triple {202#(bvsge main_~x~0 main_~y~0)} assume !(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1; {202#(bvsge main_~x~0 main_~y~0)} is VALID [2018-11-23 11:37:22,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {209#(bvsge (bvadd main_~y~0 main_~x~0) (bvadd main_~y~0 (_ bv1 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {202#(bvsge main_~x~0 main_~y~0)} is VALID [2018-11-23 11:37:22,869 INFO L273 TraceCheckUtils]: 4: Hoare triple {152#true} ~x~0 := 1bv32;~y~0 := 0bv32; {209#(bvsge (bvadd main_~y~0 main_~x~0) (bvadd main_~y~0 (_ bv1 32)))} is VALID [2018-11-23 11:37:22,869 INFO L256 TraceCheckUtils]: 3: Hoare triple {152#true} call #t~ret2 := main(); {152#true} is VALID [2018-11-23 11:37:22,870 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {152#true} {152#true} #32#return; {152#true} is VALID [2018-11-23 11:37:22,870 INFO L273 TraceCheckUtils]: 1: Hoare triple {152#true} assume true; {152#true} is VALID [2018-11-23 11:37:22,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {152#true} call ULTIMATE.init(); {152#true} is VALID [2018-11-23 11:37:22,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:22,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:37:22,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:37:22,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-11-23 11:37:22,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:22,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:37:22,923 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:22,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:37:22,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:37:22,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:37:22,924 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2018-11-23 11:37:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:23,326 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 11:37:23,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:37:23,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2018-11-23 11:37:23,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:23,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2018-11-23 11:37:23,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:37:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2018-11-23 11:37:23,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 24 transitions. [2018-11-23 11:37:23,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:23,417 INFO L225 Difference]: With dead ends: 22 [2018-11-23 11:37:23,417 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 11:37:23,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:37:23,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 11:37:23,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 11:37:23,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:23,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 11:37:23,435 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:37:23,435 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:37:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:23,437 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:37:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:37:23,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:23,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:23,438 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:37:23,438 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:37:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:23,440 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:37:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:37:23,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:23,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:23,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:23,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:23,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:37:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 11:37:23,443 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-11-23 11:37:23,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:23,444 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 11:37:23,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:37:23,444 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:37:23,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:37:23,445 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:23,445 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:23,445 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:23,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:23,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1090549245, now seen corresponding path program 2 times [2018-11-23 11:37:23,446 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:23,446 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:23,467 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:37:23,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:37:23,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:37:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:23,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:37:24,018 INFO L256 TraceCheckUtils]: 0: Hoare triple {324#true} call ULTIMATE.init(); {324#true} is VALID [2018-11-23 11:37:24,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {324#true} assume true; {324#true} is VALID [2018-11-23 11:37:24,019 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {324#true} {324#true} #32#return; {324#true} is VALID [2018-11-23 11:37:24,019 INFO L256 TraceCheckUtils]: 3: Hoare triple {324#true} call #t~ret2 := main(); {324#true} is VALID [2018-11-23 11:37:24,020 INFO L273 TraceCheckUtils]: 4: Hoare triple {324#true} ~x~0 := 1bv32;~y~0 := 0bv32; {341#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:37:24,021 INFO L273 TraceCheckUtils]: 5: Hoare triple {341#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {345#(and (= (bvadd main_~y~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:37:24,022 INFO L273 TraceCheckUtils]: 6: Hoare triple {345#(and (= (bvadd main_~y~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {349#(and (= (_ bv2 32) main_~x~0) (= main_~x~0 main_~y~0))} is VALID [2018-11-23 11:37:24,023 INFO L273 TraceCheckUtils]: 7: Hoare triple {349#(and (= (_ bv2 32) main_~x~0) (= main_~x~0 main_~y~0))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {353#(and (= (_ bv4 32) main_~x~0) (= (bvadd main_~x~0 (_ bv4294967295 32)) main_~y~0))} is VALID [2018-11-23 11:37:24,024 INFO L273 TraceCheckUtils]: 8: Hoare triple {353#(and (= (_ bv4 32) main_~x~0) (= (bvadd main_~x~0 (_ bv4294967295 32)) main_~y~0))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {357#(and (= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967293 32)) main_~y~0))} is VALID [2018-11-23 11:37:24,025 INFO L273 TraceCheckUtils]: 9: Hoare triple {357#(and (= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967293 32)) main_~y~0))} assume !(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1; {357#(and (= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967293 32)) main_~y~0))} is VALID [2018-11-23 11:37:24,027 INFO L256 TraceCheckUtils]: 10: Hoare triple {357#(and (= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967293 32)) main_~y~0))} call __VERIFIER_assert((if ~bvsge32(~x~0, ~y~0) then 1bv32 else 0bv32)); {364#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:24,028 INFO L273 TraceCheckUtils]: 11: Hoare triple {364#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {368#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:37:24,029 INFO L273 TraceCheckUtils]: 12: Hoare triple {368#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {325#false} is VALID [2018-11-23 11:37:24,030 INFO L273 TraceCheckUtils]: 13: Hoare triple {325#false} assume !false; {325#false} is VALID [2018-11-23 11:37:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:24,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:37:30,391 INFO L273 TraceCheckUtils]: 13: Hoare triple {325#false} assume !false; {325#false} is VALID [2018-11-23 11:37:30,392 INFO L273 TraceCheckUtils]: 12: Hoare triple {378#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {325#false} is VALID [2018-11-23 11:37:30,392 INFO L273 TraceCheckUtils]: 11: Hoare triple {382#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {378#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:37:30,394 INFO L256 TraceCheckUtils]: 10: Hoare triple {386#(bvsge main_~x~0 main_~y~0)} call __VERIFIER_assert((if ~bvsge32(~x~0, ~y~0) then 1bv32 else 0bv32)); {382#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:37:30,394 INFO L273 TraceCheckUtils]: 9: Hoare triple {386#(bvsge main_~x~0 main_~y~0)} assume !(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1; {386#(bvsge main_~x~0 main_~y~0)} is VALID [2018-11-23 11:37:30,399 INFO L273 TraceCheckUtils]: 8: Hoare triple {393#(bvsge (bvadd main_~y~0 main_~x~0) (bvadd main_~y~0 (_ bv1 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {386#(bvsge main_~x~0 main_~y~0)} is VALID [2018-11-23 11:37:31,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {397#(bvsge (bvadd (bvmul (_ bv2 32) main_~y~0) main_~x~0 (_ bv1 32)) (bvadd main_~y~0 (_ bv2 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {393#(bvsge (bvadd main_~y~0 main_~x~0) (bvadd main_~y~0 (_ bv1 32)))} is VALID [2018-11-23 11:37:33,916 INFO L273 TraceCheckUtils]: 6: Hoare triple {401#(bvsge (bvadd (bvmul (_ bv3 32) main_~y~0) main_~x~0 (_ bv3 32)) (bvadd main_~y~0 (_ bv3 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {397#(bvsge (bvadd (bvmul (_ bv2 32) main_~y~0) main_~x~0 (_ bv1 32)) (bvadd main_~y~0 (_ bv2 32)))} is UNKNOWN [2018-11-23 11:37:35,921 INFO L273 TraceCheckUtils]: 5: Hoare triple {405#(bvsge (bvadd (bvmul (_ bv4 32) main_~y~0) main_~x~0 (_ bv6 32)) (bvadd main_~y~0 (_ bv4 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {401#(bvsge (bvadd (bvmul (_ bv3 32) main_~y~0) main_~x~0 (_ bv3 32)) (bvadd main_~y~0 (_ bv3 32)))} is UNKNOWN [2018-11-23 11:37:35,922 INFO L273 TraceCheckUtils]: 4: Hoare triple {324#true} ~x~0 := 1bv32;~y~0 := 0bv32; {405#(bvsge (bvadd (bvmul (_ bv4 32) main_~y~0) main_~x~0 (_ bv6 32)) (bvadd main_~y~0 (_ bv4 32)))} is VALID [2018-11-23 11:37:35,922 INFO L256 TraceCheckUtils]: 3: Hoare triple {324#true} call #t~ret2 := main(); {324#true} is VALID [2018-11-23 11:37:35,923 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {324#true} {324#true} #32#return; {324#true} is VALID [2018-11-23 11:37:35,923 INFO L273 TraceCheckUtils]: 1: Hoare triple {324#true} assume true; {324#true} is VALID [2018-11-23 11:37:35,923 INFO L256 TraceCheckUtils]: 0: Hoare triple {324#true} call ULTIMATE.init(); {324#true} is VALID [2018-11-23 11:37:35,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:37:35,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:37:35,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:37:35,926 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2018-11-23 11:37:35,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:37:35,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:37:41,273 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 21 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:41,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:37:41,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:37:41,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:37:41,275 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 16 states. [2018-11-23 11:37:42,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:42,596 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 11:37:42,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:37:42,596 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2018-11-23 11:37:42,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:37:42,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:37:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2018-11-23 11:37:42,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:37:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2018-11-23 11:37:42,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 36 transitions. [2018-11-23 11:37:48,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 34 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 11:37:48,317 INFO L225 Difference]: With dead ends: 31 [2018-11-23 11:37:48,318 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:37:48,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:37:48,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:37:48,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 11:37:48,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:37:48,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 11:37:48,347 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:37:48,348 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:37:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:48,350 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:37:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:37:48,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:48,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:48,351 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:37:48,351 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:37:48,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:37:48,353 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:37:48,353 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:37:48,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:37:48,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:37:48,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:37:48,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:37:48,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:37:48,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 11:37:48,356 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2018-11-23 11:37:48,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:37:48,357 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 11:37:48,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:37:48,357 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:37:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:37:48,358 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:37:48,358 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:37:48,358 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:37:48,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:37:48,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1401185827, now seen corresponding path program 3 times [2018-11-23 11:37:48,359 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:37:48,360 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:37:48,379 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:37:48,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:37:48,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:37:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:37:48,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:40:27,287 INFO L256 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2018-11-23 11:40:27,287 INFO L273 TraceCheckUtils]: 1: Hoare triple {568#true} assume true; {568#true} is VALID [2018-11-23 11:40:27,288 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {568#true} {568#true} #32#return; {568#true} is VALID [2018-11-23 11:40:27,288 INFO L256 TraceCheckUtils]: 3: Hoare triple {568#true} call #t~ret2 := main(); {568#true} is VALID [2018-11-23 11:40:27,290 INFO L273 TraceCheckUtils]: 4: Hoare triple {568#true} ~x~0 := 1bv32;~y~0 := 0bv32; {585#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} is VALID [2018-11-23 11:40:27,291 INFO L273 TraceCheckUtils]: 5: Hoare triple {585#(and (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~y~0 (_ bv0 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {589#(and (= (bvadd main_~y~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:40:27,292 INFO L273 TraceCheckUtils]: 6: Hoare triple {589#(and (= (bvadd main_~y~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {593#(and (= (_ bv2 32) main_~x~0) (= main_~x~0 main_~y~0))} is VALID [2018-11-23 11:40:27,293 INFO L273 TraceCheckUtils]: 7: Hoare triple {593#(and (= (_ bv2 32) main_~x~0) (= main_~x~0 main_~y~0))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {597#(and (= (_ bv4 32) main_~x~0) (= (bvadd main_~x~0 (_ bv4294967295 32)) main_~y~0))} is VALID [2018-11-23 11:40:27,294 INFO L273 TraceCheckUtils]: 8: Hoare triple {597#(and (= (_ bv4 32) main_~x~0) (= (bvadd main_~x~0 (_ bv4294967295 32)) main_~y~0))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {601#(and (= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967293 32)) main_~y~0))} is VALID [2018-11-23 11:40:27,295 INFO L273 TraceCheckUtils]: 9: Hoare triple {601#(and (= (bvadd main_~x~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd main_~x~0 (_ bv4294967293 32)) main_~y~0))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {605#(and (= (_ bv7 32) (bvadd (bvneg (bvadd main_~y~0 (_ bv4294967295 32))) main_~x~0)) (= (bvadd main_~y~0 (_ bv2 32)) (bvadd (bvneg (bvadd main_~y~0 (_ bv4294967295 32))) main_~x~0)))} is VALID [2018-11-23 11:40:27,302 INFO L273 TraceCheckUtils]: 10: Hoare triple {605#(and (= (_ bv7 32) (bvadd (bvneg (bvadd main_~y~0 (_ bv4294967295 32))) main_~x~0)) (= (bvadd main_~y~0 (_ bv2 32)) (bvadd (bvneg (bvadd main_~y~0 (_ bv4294967295 32))) main_~x~0)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {609#(and (= (bvadd (bvneg (bvadd main_~y~0 (_ bv4294967294 32))) (bvneg (bvadd main_~y~0 (_ bv4294967295 32))) main_~x~0 (_ bv4294967295 32)) main_~y~0) (= (bvadd (bvneg (bvadd main_~y~0 (_ bv4294967294 32))) (bvneg (bvadd main_~y~0 (_ bv4294967295 32))) main_~x~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-23 11:40:27,312 INFO L273 TraceCheckUtils]: 11: Hoare triple {609#(and (= (bvadd (bvneg (bvadd main_~y~0 (_ bv4294967294 32))) (bvneg (bvadd main_~y~0 (_ bv4294967295 32))) main_~x~0 (_ bv4294967295 32)) main_~y~0) (= (bvadd (bvneg (bvadd main_~y~0 (_ bv4294967294 32))) (bvneg (bvadd main_~y~0 (_ bv4294967295 32))) main_~x~0 (_ bv4294967289 32)) (_ bv0 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {613#(exists ((v_main_~x~0_24 (_ BitVec 32))) (and (= (bvadd main_~x~0 (bvneg v_main_~x~0_24) (_ bv1 32)) main_~y~0) (= (bvadd main_~x~0 (bvneg v_main_~x~0_24) (_ bv1 32)) (bvadd v_main_~x~0_24 (bvneg (bvadd main_~x~0 (bvneg v_main_~x~0_24) (_ bv4294967294 32))) (bvneg (bvadd main_~x~0 (bvneg v_main_~x~0_24) (_ bv4294967295 32))))) (= (_ bv7 32) (bvadd v_main_~x~0_24 (bvneg (bvadd main_~x~0 (bvneg v_main_~x~0_24) (_ bv4294967294 32))) (bvneg (bvadd main_~x~0 (bvneg v_main_~x~0_24) (_ bv4294967295 32)))))))} is VALID [2018-11-23 11:40:27,327 INFO L273 TraceCheckUtils]: 12: Hoare triple {613#(exists ((v_main_~x~0_24 (_ BitVec 32))) (and (= (bvadd main_~x~0 (bvneg v_main_~x~0_24) (_ bv1 32)) main_~y~0) (= (bvadd main_~x~0 (bvneg v_main_~x~0_24) (_ bv1 32)) (bvadd v_main_~x~0_24 (bvneg (bvadd main_~x~0 (bvneg v_main_~x~0_24) (_ bv4294967294 32))) (bvneg (bvadd main_~x~0 (bvneg v_main_~x~0_24) (_ bv4294967295 32))))) (= (_ bv7 32) (bvadd v_main_~x~0_24 (bvneg (bvadd main_~x~0 (bvneg v_main_~x~0_24) (_ bv4294967294 32))) (bvneg (bvadd main_~x~0 (bvneg v_main_~x~0_24) (_ bv4294967295 32)))))))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {617#(exists ((v_main_~x~0_24 (_ BitVec 32))) (and (= (bvadd (bvneg (bvadd (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24) (_ bv4294967295 32))) (bvneg (bvadd (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24))) v_main_~x~0_24 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd main_~y~0 (_ bv4294967293 32)) (bvadd (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24))) (= (bvadd (bvneg (bvadd (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24) (_ bv4294967295 32))) (bvneg (bvadd (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24))) v_main_~x~0_24 (_ bv4294967294 32)) (bvadd (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24)))))} is VALID [2018-11-23 11:40:27,343 INFO L273 TraceCheckUtils]: 13: Hoare triple {617#(exists ((v_main_~x~0_24 (_ BitVec 32))) (and (= (bvadd (bvneg (bvadd (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24) (_ bv4294967295 32))) (bvneg (bvadd (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24))) v_main_~x~0_24 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd main_~y~0 (_ bv4294967293 32)) (bvadd (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24))) (= (bvadd (bvneg (bvadd (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24) (_ bv4294967295 32))) (bvneg (bvadd (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24))) v_main_~x~0_24 (_ bv4294967294 32)) (bvadd (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24)))))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {621#(exists ((v_main_~x~0_24 (_ BitVec 32))) (and (= (bvadd main_~y~0 (_ bv4294967291 32)) (bvadd (bvneg (bvadd main_~y~0 (_ bv4294967295 32))) (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24))) (= (bvadd v_main_~x~0_24 (bvneg (bvadd (bvneg (bvadd main_~y~0 (_ bv4294967295 32))) (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24) (_ bv1 32))) (bvneg (bvadd (bvneg (bvadd main_~y~0 (_ bv4294967295 32))) (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24))) (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd (bvneg (bvadd main_~y~0 (_ bv4294967295 32))) (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24) (_ bv3 32)) (bvadd v_main_~x~0_24 (bvneg (bvadd (bvneg (bvadd main_~y~0 (_ bv4294967295 32))) (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24) (_ bv1 32))) (bvneg (bvadd (bvneg (bvadd main_~y~0 (_ bv4294967295 32))) (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24)))))))} is VALID [2018-11-23 11:40:27,363 INFO L273 TraceCheckUtils]: 14: Hoare triple {621#(exists ((v_main_~x~0_24 (_ BitVec 32))) (and (= (bvadd main_~y~0 (_ bv4294967291 32)) (bvadd (bvneg (bvadd main_~y~0 (_ bv4294967295 32))) (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24))) (= (bvadd v_main_~x~0_24 (bvneg (bvadd (bvneg (bvadd main_~y~0 (_ bv4294967295 32))) (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24) (_ bv1 32))) (bvneg (bvadd (bvneg (bvadd main_~y~0 (_ bv4294967295 32))) (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24))) (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd (bvneg (bvadd main_~y~0 (_ bv4294967295 32))) (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24) (_ bv3 32)) (bvadd v_main_~x~0_24 (bvneg (bvadd (bvneg (bvadd main_~y~0 (_ bv4294967295 32))) (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24) (_ bv1 32))) (bvneg (bvadd (bvneg (bvadd main_~y~0 (_ bv4294967295 32))) (bvneg main_~y~0) main_~x~0 (bvneg v_main_~x~0_24)))))))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {625#(exists ((v_main_~x~0_27 (_ BitVec 32)) (v_main_~x~0_24 (_ BitVec 32))) (and (= (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967291 32)) (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24))) (= (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24) (_ bv3 32)) (bvadd v_main_~x~0_24 (bvneg (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24) (_ bv1 32))) (bvneg (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24))))) (= (bvadd v_main_~x~0_24 (bvneg (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24) (_ bv1 32))) (bvneg (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24))) (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd main_~y~0 (_ bv4294967295 32)) (bvadd (bvneg v_main_~x~0_27) main_~x~0))))} is VALID [2018-11-23 11:40:27,364 INFO L273 TraceCheckUtils]: 15: Hoare triple {625#(exists ((v_main_~x~0_27 (_ BitVec 32)) (v_main_~x~0_24 (_ BitVec 32))) (and (= (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967291 32)) (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24))) (= (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24) (_ bv3 32)) (bvadd v_main_~x~0_24 (bvneg (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24) (_ bv1 32))) (bvneg (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24))))) (= (bvadd v_main_~x~0_24 (bvneg (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24) (_ bv1 32))) (bvneg (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24))) (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd main_~y~0 (_ bv4294967295 32)) (bvadd (bvneg v_main_~x~0_27) main_~x~0))))} assume !(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1; {625#(exists ((v_main_~x~0_27 (_ BitVec 32)) (v_main_~x~0_24 (_ BitVec 32))) (and (= (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967291 32)) (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24))) (= (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24) (_ bv3 32)) (bvadd v_main_~x~0_24 (bvneg (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24) (_ bv1 32))) (bvneg (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24))))) (= (bvadd v_main_~x~0_24 (bvneg (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24) (_ bv1 32))) (bvneg (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24))) (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd main_~y~0 (_ bv4294967295 32)) (bvadd (bvneg v_main_~x~0_27) main_~x~0))))} is VALID [2018-11-23 11:40:27,376 INFO L256 TraceCheckUtils]: 16: Hoare triple {625#(exists ((v_main_~x~0_27 (_ BitVec 32)) (v_main_~x~0_24 (_ BitVec 32))) (and (= (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967291 32)) (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24))) (= (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24) (_ bv3 32)) (bvadd v_main_~x~0_24 (bvneg (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24) (_ bv1 32))) (bvneg (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24))))) (= (bvadd v_main_~x~0_24 (bvneg (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24) (_ bv1 32))) (bvneg (bvadd v_main_~x~0_27 (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0)) (bvneg (bvadd (bvneg v_main_~x~0_27) main_~x~0 (_ bv4294967295 32))) (bvneg v_main_~x~0_24))) (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd main_~y~0 (_ bv4294967295 32)) (bvadd (bvneg v_main_~x~0_27) main_~x~0))))} call __VERIFIER_assert((if ~bvsge32(~x~0, ~y~0) then 1bv32 else 0bv32)); {632#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:27,377 INFO L273 TraceCheckUtils]: 17: Hoare triple {632#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {636#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:40:27,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {636#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {569#false} is VALID [2018-11-23 11:40:27,378 INFO L273 TraceCheckUtils]: 19: Hoare triple {569#false} assume !false; {569#false} is VALID [2018-11-23 11:40:27,381 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:40:27,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:40:47,652 INFO L273 TraceCheckUtils]: 19: Hoare triple {569#false} assume !false; {569#false} is VALID [2018-11-23 11:40:47,653 INFO L273 TraceCheckUtils]: 18: Hoare triple {646#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {569#false} is VALID [2018-11-23 11:40:47,654 INFO L273 TraceCheckUtils]: 17: Hoare triple {650#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {646#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:40:47,655 INFO L256 TraceCheckUtils]: 16: Hoare triple {654#(bvsge main_~x~0 main_~y~0)} call __VERIFIER_assert((if ~bvsge32(~x~0, ~y~0) then 1bv32 else 0bv32)); {650#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:40:47,656 INFO L273 TraceCheckUtils]: 15: Hoare triple {654#(bvsge main_~x~0 main_~y~0)} assume !(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1; {654#(bvsge main_~x~0 main_~y~0)} is VALID [2018-11-23 11:40:47,656 INFO L273 TraceCheckUtils]: 14: Hoare triple {661#(bvsge (bvadd main_~y~0 main_~x~0) (bvadd main_~y~0 (_ bv1 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {654#(bvsge main_~x~0 main_~y~0)} is VALID [2018-11-23 11:40:49,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {665#(bvsge (bvadd (bvmul (_ bv2 32) main_~y~0) main_~x~0 (_ bv1 32)) (bvadd main_~y~0 (_ bv2 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {661#(bvsge (bvadd main_~y~0 main_~x~0) (bvadd main_~y~0 (_ bv1 32)))} is VALID [2018-11-23 11:40:51,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {669#(bvsge (bvadd (bvmul (_ bv3 32) main_~y~0) main_~x~0 (_ bv3 32)) (bvadd main_~y~0 (_ bv3 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {665#(bvsge (bvadd (bvmul (_ bv2 32) main_~y~0) main_~x~0 (_ bv1 32)) (bvadd main_~y~0 (_ bv2 32)))} is UNKNOWN [2018-11-23 11:40:53,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {673#(bvsge (bvadd (bvmul (_ bv4 32) main_~y~0) main_~x~0 (_ bv6 32)) (bvadd main_~y~0 (_ bv4 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {669#(bvsge (bvadd (bvmul (_ bv3 32) main_~y~0) main_~x~0 (_ bv3 32)) (bvadd main_~y~0 (_ bv3 32)))} is UNKNOWN [2018-11-23 11:40:55,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {677#(bvsge (bvadd (bvmul (_ bv5 32) main_~y~0) main_~x~0 (_ bv10 32)) (bvadd main_~y~0 (_ bv5 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {673#(bvsge (bvadd (bvmul (_ bv4 32) main_~y~0) main_~x~0 (_ bv6 32)) (bvadd main_~y~0 (_ bv4 32)))} is UNKNOWN [2018-11-23 11:40:57,283 INFO L273 TraceCheckUtils]: 9: Hoare triple {681#(bvsge (bvadd (bvmul (_ bv6 32) main_~y~0) main_~x~0 (_ bv15 32)) (bvadd main_~y~0 (_ bv6 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {677#(bvsge (bvadd (bvmul (_ bv5 32) main_~y~0) main_~x~0 (_ bv10 32)) (bvadd main_~y~0 (_ bv5 32)))} is UNKNOWN [2018-11-23 11:40:59,289 INFO L273 TraceCheckUtils]: 8: Hoare triple {685#(bvsge (bvadd (bvmul (_ bv7 32) main_~y~0) main_~x~0 (_ bv21 32)) (bvadd main_~y~0 (_ bv7 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {681#(bvsge (bvadd (bvmul (_ bv6 32) main_~y~0) main_~x~0 (_ bv15 32)) (bvadd main_~y~0 (_ bv6 32)))} is UNKNOWN [2018-11-23 11:41:01,293 INFO L273 TraceCheckUtils]: 7: Hoare triple {689#(bvsge (bvadd (bvmul (_ bv8 32) main_~y~0) main_~x~0 (_ bv28 32)) (bvadd main_~y~0 (_ bv8 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {685#(bvsge (bvadd (bvmul (_ bv7 32) main_~y~0) main_~x~0 (_ bv21 32)) (bvadd main_~y~0 (_ bv7 32)))} is UNKNOWN [2018-11-23 11:41:03,298 INFO L273 TraceCheckUtils]: 6: Hoare triple {693#(bvsge (bvadd (bvmul (_ bv9 32) main_~y~0) main_~x~0 (_ bv36 32)) (bvadd main_~y~0 (_ bv9 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {689#(bvsge (bvadd (bvmul (_ bv8 32) main_~y~0) main_~x~0 (_ bv28 32)) (bvadd main_~y~0 (_ bv8 32)))} is UNKNOWN [2018-11-23 11:41:05,303 INFO L273 TraceCheckUtils]: 5: Hoare triple {697#(bvsge (bvadd (bvmul (_ bv10 32) main_~y~0) main_~x~0 (_ bv45 32)) (bvadd main_~y~0 (_ bv10 32)))} assume !!(~bvslt32(~y~0, 1000bv32) && 0bv32 != #t~nondet1);havoc #t~nondet1;~x~0 := ~bvadd32(~x~0, ~y~0);~y~0 := ~bvadd32(1bv32, ~y~0); {693#(bvsge (bvadd (bvmul (_ bv9 32) main_~y~0) main_~x~0 (_ bv36 32)) (bvadd main_~y~0 (_ bv9 32)))} is UNKNOWN [2018-11-23 11:41:05,304 INFO L273 TraceCheckUtils]: 4: Hoare triple {568#true} ~x~0 := 1bv32;~y~0 := 0bv32; {697#(bvsge (bvadd (bvmul (_ bv10 32) main_~y~0) main_~x~0 (_ bv45 32)) (bvadd main_~y~0 (_ bv10 32)))} is VALID [2018-11-23 11:41:05,304 INFO L256 TraceCheckUtils]: 3: Hoare triple {568#true} call #t~ret2 := main(); {568#true} is VALID [2018-11-23 11:41:05,304 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {568#true} {568#true} #32#return; {568#true} is VALID [2018-11-23 11:41:05,305 INFO L273 TraceCheckUtils]: 1: Hoare triple {568#true} assume true; {568#true} is VALID [2018-11-23 11:41:05,305 INFO L256 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2018-11-23 11:41:05,307 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:41:05,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:41:05,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-23 11:41:05,314 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 20 [2018-11-23 11:41:05,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:41:05,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states.