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-new/count_by_1_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:33:55,501 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:33:55,504 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:33:55,522 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:33:55,522 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:33:55,523 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:33:55,525 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:33:55,528 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:33:55,531 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:33:55,531 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:33:55,540 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:33:55,540 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:33:55,542 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:33:55,547 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:33:55,550 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:33:55,551 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:33:55,552 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:33:55,555 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:33:55,560 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:33:55,561 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:33:55,564 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:33:55,566 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:33:55,568 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:33:55,568 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:33:55,571 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:33:55,572 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:33:55,574 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:33:55,575 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:33:55,576 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:33:55,577 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:33:55,578 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:33:55,578 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:33:55,578 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:33:55,579 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:33:55,579 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:33:55,580 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:33:55,580 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:33:55,603 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:33:55,603 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:33:55,605 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:33:55,605 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:33:55,606 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:33:55,606 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:33:55,606 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:33:55,606 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:33:55,607 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:33:55,607 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:33:55,607 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:33:55,607 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:33:55,607 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:33:55,607 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:33:55,608 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:33:55,608 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:33:55,608 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:33:55,608 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:33:55,608 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:33:55,609 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:33:55,610 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:33:55,610 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:33:55,610 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:33:55,610 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:33:55,611 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:33:55,611 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:33:55,611 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:33:55,611 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:33:55,611 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:33:55,612 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:33:55,612 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:33:55,612 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:33:55,612 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:33:55,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:33:55,697 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:33:55,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:33:55,703 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:33:55,704 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:33:55,705 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_1_true-unreach-call_true-termination.i [2018-11-14 18:33:55,775 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988b0a096/04773f9a7207483fa5690c9331f0b15f/FLAG55f9331ae [2018-11-14 18:33:56,276 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:33:56,277 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_1_true-unreach-call_true-termination.i [2018-11-14 18:33:56,285 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988b0a096/04773f9a7207483fa5690c9331f0b15f/FLAG55f9331ae [2018-11-14 18:33:56,306 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988b0a096/04773f9a7207483fa5690c9331f0b15f [2018-11-14 18:33:56,318 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:33:56,321 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:33:56,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:33:56,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:33:56,328 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:33:56,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:33:56" (1/1) ... [2018-11-14 18:33:56,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2211c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:33:56, skipping insertion in model container [2018-11-14 18:33:56,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:33:56" (1/1) ... [2018-11-14 18:33:56,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:33:56,365 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:33:56,554 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:33:56,560 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:33:56,576 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:33:56,592 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:33:56,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:33:56 WrapperNode [2018-11-14 18:33:56,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:33:56,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:33:56,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:33:56,593 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:33:56,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:33:56" (1/1) ... [2018-11-14 18:33:56,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:33:56" (1/1) ... [2018-11-14 18:33:56,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:33:56" (1/1) ... [2018-11-14 18:33:56,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:33:56" (1/1) ... [2018-11-14 18:33:56,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:33:56" (1/1) ... [2018-11-14 18:33:56,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:33:56" (1/1) ... [2018-11-14 18:33:56,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:33:56" (1/1) ... [2018-11-14 18:33:56,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:33:56,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:33:56,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:33:56,632 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:33:56,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:33:56" (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:33:56,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:33:56,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:33:56,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:33:56,767 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:33:56,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:33:56,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 18:33:56,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:33:56,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:33:56,768 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:33:56,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:33:56,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:33:57,194 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:33:57,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:33:57 BoogieIcfgContainer [2018-11-14 18:33:57,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:33:57,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:33:57,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:33:57,200 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:33:57,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:33:56" (1/3) ... [2018-11-14 18:33:57,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4fc0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:33:57, skipping insertion in model container [2018-11-14 18:33:57,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:33:56" (2/3) ... [2018-11-14 18:33:57,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4fc0e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:33:57, skipping insertion in model container [2018-11-14 18:33:57,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:33:57" (3/3) ... [2018-11-14 18:33:57,204 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_1_true-unreach-call_true-termination.i [2018-11-14 18:33:57,215 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:33:57,224 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:33:57,242 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:33:57,277 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:33:57,278 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:33:57,278 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:33:57,278 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:33:57,278 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:33:57,278 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:33:57,279 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:33:57,279 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:33:57,279 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:33:57,299 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-14 18:33:57,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 18:33:57,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:33:57,306 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:33:57,309 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:33:57,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:33:57,315 INFO L82 PathProgramCache]: Analyzing trace with hash 563245249, now seen corresponding path program 1 times [2018-11-14 18:33:57,319 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:33:57,320 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:33:57,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:33:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:33:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:33:57,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:33:57,448 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-14 18:33:57,452 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-14 18:33:57,453 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #34#return; {23#true} is VALID [2018-11-14 18:33:57,453 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2018-11-14 18:33:57,454 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~i~0;~i~0 := 0bv32; {23#true} is VALID [2018-11-14 18:33:57,460 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !true; {24#false} is VALID [2018-11-14 18:33:57,461 INFO L256 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if ~i~0 == 1000000bv32 then 1bv32 else 0bv32)); {24#false} is VALID [2018-11-14 18:33:57,461 INFO L273 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-14 18:33:57,462 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#false} assume ~cond == 0bv32; {24#false} is VALID [2018-11-14 18:33:57,462 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-14 18:33:57,465 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:33:57,466 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:33:57,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:33:57,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:33:57,477 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 18:33:57,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:33:57,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:33:57,543 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-14 18:33:57,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:33:57,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:33:57,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:33:57,554 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-14 18:33:57,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:33:57,622 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-14 18:33:57,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:33:57,622 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 18:33:57,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:33:57,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:33:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-14 18:33:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:33:57,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-14 18:33:57,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 35 transitions. [2018-11-14 18:33:57,939 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:57,952 INFO L225 Difference]: With dead ends: 32 [2018-11-14 18:33:57,952 INFO L226 Difference]: Without dead ends: 13 [2018-11-14 18:33:57,956 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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:33:57,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-14 18:33:58,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-14 18:33:58,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:33:58,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-14 18:33:58,028 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-14 18:33:58,028 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-14 18:33:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:33:58,032 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-14 18:33:58,032 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 18:33:58,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:33:58,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:33:58,033 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-14 18:33:58,033 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-14 18:33:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:33:58,036 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-14 18:33:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 18:33:58,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:33:58,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:33:58,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:33:58,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:33:58,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:33:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-14 18:33:58,042 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-11-14 18:33:58,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:33:58,043 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-14 18:33:58,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:33:58,043 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 18:33:58,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 18:33:58,044 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:33:58,044 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:33:58,044 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:33:58,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:33:58,045 INFO L82 PathProgramCache]: Analyzing trace with hash -496423, now seen corresponding path program 1 times [2018-11-14 18:33:58,045 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:33:58,045 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:33:58,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:33:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:33:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:33:58,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:33:58,207 INFO L256 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {141#true} is VALID [2018-11-14 18:33:58,208 INFO L273 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2018-11-14 18:33:58,208 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #34#return; {141#true} is VALID [2018-11-14 18:33:58,208 INFO L256 TraceCheckUtils]: 3: Hoare triple {141#true} call #t~ret2 := main(); {141#true} is VALID [2018-11-14 18:33:58,213 INFO L273 TraceCheckUtils]: 4: Hoare triple {141#true} havoc ~i~0;~i~0 := 0bv32; {158#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:33:58,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {158#(= main_~i~0 (_ bv0 32))} assume true; {158#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:33:58,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {158#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 1000000bv32); {142#false} is VALID [2018-11-14 18:33:58,215 INFO L256 TraceCheckUtils]: 7: Hoare triple {142#false} call __VERIFIER_assert((if ~i~0 == 1000000bv32 then 1bv32 else 0bv32)); {142#false} is VALID [2018-11-14 18:33:58,215 INFO L273 TraceCheckUtils]: 8: Hoare triple {142#false} ~cond := #in~cond; {142#false} is VALID [2018-11-14 18:33:58,216 INFO L273 TraceCheckUtils]: 9: Hoare triple {142#false} assume ~cond == 0bv32; {142#false} is VALID [2018-11-14 18:33:58,216 INFO L273 TraceCheckUtils]: 10: Hoare triple {142#false} assume !false; {142#false} is VALID [2018-11-14 18:33:58,217 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:33:58,217 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:33:58,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:33:58,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:33:58,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 18:33:58,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:33:58,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:33:58,285 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:33:58,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:33:58,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:33:58,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:33:58,286 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2018-11-14 18:33:58,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:33:58,366 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 18:33:58,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:33:58,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 18:33:58,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:33:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:33:58,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-11-14 18:33:58,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:33:58,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-11-14 18:33:58,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2018-11-14 18:33:58,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:33:58,512 INFO L225 Difference]: With dead ends: 21 [2018-11-14 18:33:58,513 INFO L226 Difference]: Without dead ends: 16 [2018-11-14 18:33:58,514 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:33:58,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-14 18:33:58,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-14 18:33:58,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:33:58,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2018-11-14 18:33:58,529 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2018-11-14 18:33:58,529 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2018-11-14 18:33:58,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:33:58,531 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-14 18:33:58,531 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 18:33:58,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:33:58,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:33:58,532 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2018-11-14 18:33:58,533 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2018-11-14 18:33:58,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:33:58,535 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-14 18:33:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 18:33:58,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:33:58,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:33:58,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:33:58,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:33:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:33:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-14 18:33:58,538 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-11-14 18:33:58,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:33:58,538 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-14 18:33:58,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:33:58,539 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-14 18:33:58,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 18:33:58,539 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:33:58,540 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:33:58,540 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:33:58,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:33:58,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1177044387, now seen corresponding path program 1 times [2018-11-14 18:33:58,541 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:33:58,541 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:33:58,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:33:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:33:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:33:58,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:33:58,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {262#true} is VALID [2018-11-14 18:33:58,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2018-11-14 18:33:58,652 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #34#return; {262#true} is VALID [2018-11-14 18:33:58,652 INFO L256 TraceCheckUtils]: 3: Hoare triple {262#true} call #t~ret2 := main(); {262#true} is VALID [2018-11-14 18:33:58,653 INFO L273 TraceCheckUtils]: 4: Hoare triple {262#true} havoc ~i~0;~i~0 := 0bv32; {279#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:33:58,657 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#(= main_~i~0 (_ bv0 32))} assume true; {279#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:33:58,658 INFO L273 TraceCheckUtils]: 6: Hoare triple {279#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 1000000bv32); {279#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:33:58,659 INFO L273 TraceCheckUtils]: 7: Hoare triple {279#(= main_~i~0 (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {289#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:33:58,661 INFO L273 TraceCheckUtils]: 8: Hoare triple {289#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {289#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:33:58,663 INFO L273 TraceCheckUtils]: 9: Hoare triple {289#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 1000000bv32); {263#false} is VALID [2018-11-14 18:33:58,663 INFO L256 TraceCheckUtils]: 10: Hoare triple {263#false} call __VERIFIER_assert((if ~i~0 == 1000000bv32 then 1bv32 else 0bv32)); {263#false} is VALID [2018-11-14 18:33:58,663 INFO L273 TraceCheckUtils]: 11: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2018-11-14 18:33:58,664 INFO L273 TraceCheckUtils]: 12: Hoare triple {263#false} assume ~cond == 0bv32; {263#false} is VALID [2018-11-14 18:33:58,664 INFO L273 TraceCheckUtils]: 13: Hoare triple {263#false} assume !false; {263#false} is VALID [2018-11-14 18:33:58,666 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:33:58,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:33:58,770 INFO L273 TraceCheckUtils]: 13: Hoare triple {263#false} assume !false; {263#false} is VALID [2018-11-14 18:33:58,770 INFO L273 TraceCheckUtils]: 12: Hoare triple {263#false} assume ~cond == 0bv32; {263#false} is VALID [2018-11-14 18:33:58,770 INFO L273 TraceCheckUtils]: 11: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2018-11-14 18:33:58,771 INFO L256 TraceCheckUtils]: 10: Hoare triple {263#false} call __VERIFIER_assert((if ~i~0 == 1000000bv32 then 1bv32 else 0bv32)); {263#false} is VALID [2018-11-14 18:33:58,771 INFO L273 TraceCheckUtils]: 9: Hoare triple {320#(bvslt main_~i~0 (_ bv1000000 32))} assume !~bvslt32(~i~0, 1000000bv32); {263#false} is VALID [2018-11-14 18:33:58,772 INFO L273 TraceCheckUtils]: 8: Hoare triple {320#(bvslt main_~i~0 (_ bv1000000 32))} assume true; {320#(bvslt main_~i~0 (_ bv1000000 32))} is VALID [2018-11-14 18:33:58,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {327#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {320#(bvslt main_~i~0 (_ bv1000000 32))} is VALID [2018-11-14 18:33:58,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {327#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} assume !!~bvslt32(~i~0, 1000000bv32); {327#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} is VALID [2018-11-14 18:33:58,774 INFO L273 TraceCheckUtils]: 5: Hoare triple {327#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} assume true; {327#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} is VALID [2018-11-14 18:33:58,775 INFO L273 TraceCheckUtils]: 4: Hoare triple {262#true} havoc ~i~0;~i~0 := 0bv32; {327#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} is VALID [2018-11-14 18:33:58,775 INFO L256 TraceCheckUtils]: 3: Hoare triple {262#true} call #t~ret2 := main(); {262#true} is VALID [2018-11-14 18:33:58,776 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #34#return; {262#true} is VALID [2018-11-14 18:33:58,777 INFO L273 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2018-11-14 18:33:58,777 INFO L256 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {262#true} is VALID [2018-11-14 18:33:58,778 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:33:58,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:33:58,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 18:33:58,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-14 18:33:58,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:33:58,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:33:59,027 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:33:59,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:33:59,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:33:59,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:33:59,028 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 6 states. [2018-11-14 18:33:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:33:59,331 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-14 18:33:59,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:33:59,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-14 18:33:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:33:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:33:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-11-14 18:33:59,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:33:59,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-11-14 18:33:59,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2018-11-14 18:33:59,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:33:59,435 INFO L225 Difference]: With dead ends: 29 [2018-11-14 18:33:59,435 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 18:33:59,436 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:33:59,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 18:33:59,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 18:33:59,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:33:59,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 18:33:59,448 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 18:33:59,448 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 18:33:59,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:33:59,451 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 18:33:59,451 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 18:33:59,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:33:59,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:33:59,452 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 18:33:59,452 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 18:33:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:33:59,455 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 18:33:59,455 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 18:33:59,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:33:59,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:33:59,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:33:59,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:33:59,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:33:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-14 18:33:59,458 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 14 [2018-11-14 18:33:59,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:33:59,459 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-14 18:33:59,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:33:59,459 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 18:33:59,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 18:33:59,460 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:33:59,460 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:33:59,460 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:33:59,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:33:59,461 INFO L82 PathProgramCache]: Analyzing trace with hash -35450919, now seen corresponding path program 2 times [2018-11-14 18:33:59,461 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:33:59,461 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:33:59,480 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:33:59,501 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:33:59,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:33:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:33:59,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:33:59,740 INFO L256 TraceCheckUtils]: 0: Hoare triple {478#true} call ULTIMATE.init(); {478#true} is VALID [2018-11-14 18:33:59,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {478#true} assume true; {478#true} is VALID [2018-11-14 18:33:59,741 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {478#true} {478#true} #34#return; {478#true} is VALID [2018-11-14 18:33:59,741 INFO L256 TraceCheckUtils]: 3: Hoare triple {478#true} call #t~ret2 := main(); {478#true} is VALID [2018-11-14 18:33:59,746 INFO L273 TraceCheckUtils]: 4: Hoare triple {478#true} havoc ~i~0;~i~0 := 0bv32; {495#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:33:59,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {495#(= main_~i~0 (_ bv0 32))} assume true; {495#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:33:59,747 INFO L273 TraceCheckUtils]: 6: Hoare triple {495#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 1000000bv32); {495#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 18:33:59,747 INFO L273 TraceCheckUtils]: 7: Hoare triple {495#(= main_~i~0 (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {505#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:33:59,748 INFO L273 TraceCheckUtils]: 8: Hoare triple {505#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {505#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:33:59,749 INFO L273 TraceCheckUtils]: 9: Hoare triple {505#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1000000bv32); {505#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:33:59,749 INFO L273 TraceCheckUtils]: 10: Hoare triple {505#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {515#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 18:33:59,750 INFO L273 TraceCheckUtils]: 11: Hoare triple {515#(= (_ bv2 32) main_~i~0)} assume true; {515#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 18:33:59,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {515#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 1000000bv32); {515#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 18:33:59,754 INFO L273 TraceCheckUtils]: 13: Hoare triple {515#(= (_ bv2 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {525#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:33:59,755 INFO L273 TraceCheckUtils]: 14: Hoare triple {525#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {525#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:33:59,757 INFO L273 TraceCheckUtils]: 15: Hoare triple {525#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1000000bv32); {525#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 18:33:59,759 INFO L273 TraceCheckUtils]: 16: Hoare triple {525#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {535#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 18:33:59,760 INFO L273 TraceCheckUtils]: 17: Hoare triple {535#(= (_ bv4 32) main_~i~0)} assume true; {535#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 18:33:59,761 INFO L273 TraceCheckUtils]: 18: Hoare triple {535#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 1000000bv32); {479#false} is VALID [2018-11-14 18:33:59,761 INFO L256 TraceCheckUtils]: 19: Hoare triple {479#false} call __VERIFIER_assert((if ~i~0 == 1000000bv32 then 1bv32 else 0bv32)); {479#false} is VALID [2018-11-14 18:33:59,761 INFO L273 TraceCheckUtils]: 20: Hoare triple {479#false} ~cond := #in~cond; {479#false} is VALID [2018-11-14 18:33:59,762 INFO L273 TraceCheckUtils]: 21: Hoare triple {479#false} assume ~cond == 0bv32; {479#false} is VALID [2018-11-14 18:33:59,762 INFO L273 TraceCheckUtils]: 22: Hoare triple {479#false} assume !false; {479#false} is VALID [2018-11-14 18:33:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:33:59,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:34:00,114 INFO L273 TraceCheckUtils]: 22: Hoare triple {479#false} assume !false; {479#false} is VALID [2018-11-14 18:34:00,115 INFO L273 TraceCheckUtils]: 21: Hoare triple {479#false} assume ~cond == 0bv32; {479#false} is VALID [2018-11-14 18:34:00,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {479#false} ~cond := #in~cond; {479#false} is VALID [2018-11-14 18:34:00,116 INFO L256 TraceCheckUtils]: 19: Hoare triple {479#false} call __VERIFIER_assert((if ~i~0 == 1000000bv32 then 1bv32 else 0bv32)); {479#false} is VALID [2018-11-14 18:34:00,117 INFO L273 TraceCheckUtils]: 18: Hoare triple {566#(bvslt main_~i~0 (_ bv1000000 32))} assume !~bvslt32(~i~0, 1000000bv32); {479#false} is VALID [2018-11-14 18:34:00,117 INFO L273 TraceCheckUtils]: 17: Hoare triple {566#(bvslt main_~i~0 (_ bv1000000 32))} assume true; {566#(bvslt main_~i~0 (_ bv1000000 32))} is VALID [2018-11-14 18:34:00,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {573#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {566#(bvslt main_~i~0 (_ bv1000000 32))} is VALID [2018-11-14 18:34:00,119 INFO L273 TraceCheckUtils]: 15: Hoare triple {573#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} assume !!~bvslt32(~i~0, 1000000bv32); {573#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} is VALID [2018-11-14 18:34:00,120 INFO L273 TraceCheckUtils]: 14: Hoare triple {573#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} assume true; {573#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} is VALID [2018-11-14 18:34:00,127 INFO L273 TraceCheckUtils]: 13: Hoare triple {583#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1000000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {573#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1000000 32))} is VALID [2018-11-14 18:34:00,128 INFO L273 TraceCheckUtils]: 12: Hoare triple {583#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1000000 32))} assume !!~bvslt32(~i~0, 1000000bv32); {583#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1000000 32))} is VALID [2018-11-14 18:34:00,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {583#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1000000 32))} assume true; {583#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1000000 32))} is VALID [2018-11-14 18:34:00,138 INFO L273 TraceCheckUtils]: 10: Hoare triple {593#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1000000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {583#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1000000 32))} is VALID [2018-11-14 18:34:00,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {593#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1000000 32))} assume !!~bvslt32(~i~0, 1000000bv32); {593#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1000000 32))} is VALID [2018-11-14 18:34:00,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {593#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1000000 32))} assume true; {593#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1000000 32))} is VALID [2018-11-14 18:34:00,149 INFO L273 TraceCheckUtils]: 7: Hoare triple {603#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1000000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {593#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1000000 32))} is VALID [2018-11-14 18:34:00,156 INFO L273 TraceCheckUtils]: 6: Hoare triple {603#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1000000 32))} assume !!~bvslt32(~i~0, 1000000bv32); {603#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1000000 32))} is VALID [2018-11-14 18:34:00,156 INFO L273 TraceCheckUtils]: 5: Hoare triple {603#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1000000 32))} assume true; {603#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1000000 32))} is VALID [2018-11-14 18:34:00,157 INFO L273 TraceCheckUtils]: 4: Hoare triple {478#true} havoc ~i~0;~i~0 := 0bv32; {603#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1000000 32))} is VALID [2018-11-14 18:34:00,157 INFO L256 TraceCheckUtils]: 3: Hoare triple {478#true} call #t~ret2 := main(); {478#true} is VALID [2018-11-14 18:34:00,157 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {478#true} {478#true} #34#return; {478#true} is VALID [2018-11-14 18:34:00,158 INFO L273 TraceCheckUtils]: 1: Hoare triple {478#true} assume true; {478#true} is VALID [2018-11-14 18:34:00,158 INFO L256 TraceCheckUtils]: 0: Hoare triple {478#true} call ULTIMATE.init(); {478#true} is VALID [2018-11-14 18:34:00,159 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:34:00,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:34:00,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 18:34:00,162 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-11-14 18:34:00,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:34:00,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:34:00,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:34:00,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:34:00,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:34:00,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:34:00,287 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 12 states. [2018-11-14 18:34:00,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:34:00,902 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-14 18:34:00,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:34:00,903 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-11-14 18:34:00,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:34:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:34:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2018-11-14 18:34:00,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:34:00,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2018-11-14 18:34:00,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 52 transitions. [2018-11-14 18:34:01,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:34:01,015 INFO L225 Difference]: With dead ends: 47 [2018-11-14 18:34:01,015 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 18:34:01,016 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:34:01,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 18:34:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-14 18:34:01,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:34:01,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-14 18:34:01,055 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 18:34:01,055 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 18:34:01,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:34:01,058 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-14 18:34:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-14 18:34:01,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:34:01,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:34:01,059 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 18:34:01,059 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 18:34:01,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:34:01,063 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-14 18:34:01,063 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-14 18:34:01,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:34:01,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:34:01,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:34:01,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:34:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 18:34:01,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-14 18:34:01,067 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 23 [2018-11-14 18:34:01,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:34:01,067 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-14 18:34:01,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:34:01,068 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-14 18:34:01,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 18:34:01,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:34:01,069 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:34:01,070 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:34:01,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:34:01,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1956746329, now seen corresponding path program 3 times [2018-11-14 18:34:01,071 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:34:01,071 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:34:01,096 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 18:34:01,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 18:34:01,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:34:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:34:01,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:34:01,342 INFO L256 TraceCheckUtils]: 0: Hoare triple {844#true} call ULTIMATE.init(); {844#true} is VALID [2018-11-14 18:34:01,342 INFO L273 TraceCheckUtils]: 1: Hoare triple {844#true} assume true; {844#true} is VALID [2018-11-14 18:34:01,343 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {844#true} {844#true} #34#return; {844#true} is VALID [2018-11-14 18:34:01,343 INFO L256 TraceCheckUtils]: 3: Hoare triple {844#true} call #t~ret2 := main(); {844#true} is VALID [2018-11-14 18:34:01,343 INFO L273 TraceCheckUtils]: 4: Hoare triple {844#true} havoc ~i~0;~i~0 := 0bv32; {844#true} is VALID [2018-11-14 18:34:01,344 INFO L273 TraceCheckUtils]: 5: Hoare triple {844#true} assume true; {844#true} is VALID [2018-11-14 18:34:01,344 INFO L273 TraceCheckUtils]: 6: Hoare triple {844#true} assume !!~bvslt32(~i~0, 1000000bv32); {844#true} is VALID [2018-11-14 18:34:01,345 INFO L273 TraceCheckUtils]: 7: Hoare triple {844#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {844#true} is VALID [2018-11-14 18:34:01,345 INFO L273 TraceCheckUtils]: 8: Hoare triple {844#true} assume true; {844#true} is VALID [2018-11-14 18:34:01,345 INFO L273 TraceCheckUtils]: 9: Hoare triple {844#true} assume !!~bvslt32(~i~0, 1000000bv32); {844#true} is VALID [2018-11-14 18:34:01,345 INFO L273 TraceCheckUtils]: 10: Hoare triple {844#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {844#true} is VALID [2018-11-14 18:34:01,345 INFO L273 TraceCheckUtils]: 11: Hoare triple {844#true} assume true; {844#true} is VALID [2018-11-14 18:34:01,346 INFO L273 TraceCheckUtils]: 12: Hoare triple {844#true} assume !!~bvslt32(~i~0, 1000000bv32); {844#true} is VALID [2018-11-14 18:34:01,346 INFO L273 TraceCheckUtils]: 13: Hoare triple {844#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {844#true} is VALID [2018-11-14 18:34:01,346 INFO L273 TraceCheckUtils]: 14: Hoare triple {844#true} assume true; {844#true} is VALID [2018-11-14 18:34:01,347 INFO L273 TraceCheckUtils]: 15: Hoare triple {844#true} assume !!~bvslt32(~i~0, 1000000bv32); {844#true} is VALID [2018-11-14 18:34:01,347 INFO L273 TraceCheckUtils]: 16: Hoare triple {844#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {844#true} is VALID [2018-11-14 18:34:01,347 INFO L273 TraceCheckUtils]: 17: Hoare triple {844#true} assume true; {844#true} is VALID [2018-11-14 18:34:01,348 INFO L273 TraceCheckUtils]: 18: Hoare triple {844#true} assume !!~bvslt32(~i~0, 1000000bv32); {844#true} is VALID [2018-11-14 18:34:01,348 INFO L273 TraceCheckUtils]: 19: Hoare triple {844#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {844#true} is VALID [2018-11-14 18:34:01,348 INFO L273 TraceCheckUtils]: 20: Hoare triple {844#true} assume true; {844#true} is VALID [2018-11-14 18:34:01,348 INFO L273 TraceCheckUtils]: 21: Hoare triple {844#true} assume !!~bvslt32(~i~0, 1000000bv32); {844#true} is VALID [2018-11-14 18:34:01,349 INFO L273 TraceCheckUtils]: 22: Hoare triple {844#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {844#true} is VALID [2018-11-14 18:34:01,349 INFO L273 TraceCheckUtils]: 23: Hoare triple {844#true} assume true; {844#true} is VALID [2018-11-14 18:34:01,349 INFO L273 TraceCheckUtils]: 24: Hoare triple {844#true} assume !!~bvslt32(~i~0, 1000000bv32); {844#true} is VALID [2018-11-14 18:34:01,350 INFO L273 TraceCheckUtils]: 25: Hoare triple {844#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {844#true} is VALID [2018-11-14 18:34:01,350 INFO L273 TraceCheckUtils]: 26: Hoare triple {844#true} assume true; {844#true} is VALID [2018-11-14 18:34:01,350 INFO L273 TraceCheckUtils]: 27: Hoare triple {844#true} assume !!~bvslt32(~i~0, 1000000bv32); {844#true} is VALID [2018-11-14 18:34:01,350 INFO L273 TraceCheckUtils]: 28: Hoare triple {844#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {844#true} is VALID [2018-11-14 18:34:01,351 INFO L273 TraceCheckUtils]: 29: Hoare triple {844#true} assume true; {844#true} is VALID [2018-11-14 18:34:01,351 INFO L273 TraceCheckUtils]: 30: Hoare triple {844#true} assume !!~bvslt32(~i~0, 1000000bv32); {844#true} is VALID [2018-11-14 18:34:01,351 INFO L273 TraceCheckUtils]: 31: Hoare triple {844#true} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {844#true} is VALID [2018-11-14 18:34:01,352 INFO L273 TraceCheckUtils]: 32: Hoare triple {844#true} assume true; {844#true} is VALID [2018-11-14 18:34:01,356 INFO L273 TraceCheckUtils]: 33: Hoare triple {844#true} assume !!~bvslt32(~i~0, 1000000bv32); {948#(bvslt main_~i~0 (_ bv1000000 32))} is VALID [2018-11-14 18:34:01,363 INFO L273 TraceCheckUtils]: 34: Hoare triple {948#(bvslt main_~i~0 (_ bv1000000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {952#(bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1000000 32))} is VALID [2018-11-14 18:34:01,365 INFO L273 TraceCheckUtils]: 35: Hoare triple {952#(bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1000000 32))} assume true; {952#(bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1000000 32))} is VALID [2018-11-14 18:34:01,367 INFO L273 TraceCheckUtils]: 36: Hoare triple {952#(bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1000000 32))} assume !~bvslt32(~i~0, 1000000bv32); {959#(and (not (bvslt main_~i~0 (_ bv1000000 32))) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1000000 32)))} is VALID [2018-11-14 18:34:01,372 INFO L256 TraceCheckUtils]: 37: Hoare triple {959#(and (not (bvslt main_~i~0 (_ bv1000000 32))) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1000000 32)))} call __VERIFIER_assert((if ~i~0 == 1000000bv32 then 1bv32 else 0bv32)); {963#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:34:01,373 INFO L273 TraceCheckUtils]: 38: Hoare triple {963#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {967#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:34:01,376 INFO L273 TraceCheckUtils]: 39: Hoare triple {967#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {845#false} is VALID [2018-11-14 18:34:01,376 INFO L273 TraceCheckUtils]: 40: Hoare triple {845#false} assume !false; {845#false} is VALID [2018-11-14 18:34:01,379 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-14 18:34:01,380 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:34:01,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:34:01,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 18:34:01,389 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-11-14 18:34:01,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:34:01,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:34:01,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:34:01,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:34:01,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:34:01,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:34:01,518 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 7 states. [2018-11-14 18:34:01,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:34:01,892 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-14 18:34:01,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:34:01,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-11-14 18:34:01,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:34:01,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:34:01,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-14 18:34:01,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:34:01,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 15 transitions. [2018-11-14 18:34:01,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 15 transitions. [2018-11-14 18:34:01,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:34:01,930 INFO L225 Difference]: With dead ends: 42 [2018-11-14 18:34:01,930 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 18:34:01,930 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:34:01,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 18:34:01,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 18:34:01,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:34:01,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 18:34:01,931 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:34:01,931 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:34:01,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:34:01,932 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:34:01,932 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:34:01,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:34:01,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:34:01,932 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 18:34:01,932 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 18:34:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:34:01,933 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 18:34:01,933 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:34:01,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:34:01,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:34:01,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:34:01,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:34:01,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 18:34:01,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 18:34:01,934 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2018-11-14 18:34:01,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:34:01,934 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 18:34:01,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:34:01,934 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 18:34:01,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:34:01,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 18:34:02,252 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 18:34:02,253 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:34:02,253 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 18:34:02,253 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 18:34:02,253 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 18:34:02,253 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 18:34:02,253 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 15) the Hoare annotation is: true [2018-11-14 18:34:02,253 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 15) no Hoare annotation was computed. [2018-11-14 18:34:02,253 INFO L425 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-11-14 18:34:02,253 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 15) no Hoare annotation was computed. [2018-11-14 18:34:02,254 INFO L425 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. [2018-11-14 18:34:02,254 INFO L425 ceAbstractionStarter]: For program point L12-3(line 12) no Hoare annotation was computed. [2018-11-14 18:34:02,254 INFO L421 ceAbstractionStarter]: At program point L12-4(line 12) the Hoare annotation is: (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1000000 32)) [2018-11-14 18:34:02,254 INFO L421 ceAbstractionStarter]: At program point L12-5(line 12) the Hoare annotation is: (and (not (bvslt main_~i~0 (_ bv1000000 32))) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv1000000 32))) [2018-11-14 18:34:02,254 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-14 18:34:02,255 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-14 18:34:02,255 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-14 18:34:02,255 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-14 18:34:02,255 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-14 18:34:02,255 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-14 18:34:02,257 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 18:34:02,258 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 18:34:02,258 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 18:34:02,258 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:34:02,258 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2018-11-14 18:34:02,258 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 18:34:02,259 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 18:34:02,259 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 18:34:02,259 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2018-11-14 18:34:02,259 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2018-11-14 18:34:02,259 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-14 18:34:02,259 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 18:34:02,260 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 18:34:02,260 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-14 18:34:02,260 WARN L170 areAnnotationChecker]: L12-3 has no Hoare annotation [2018-11-14 18:34:02,260 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-14 18:34:02,261 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 18:34:02,261 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 18:34:02,261 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 18:34:02,261 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 18:34:02,266 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 [2018-11-14 18:34:02,267 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 [2018-11-14 18:34:02,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 06:34:02 BoogieIcfgContainer [2018-11-14 18:34:02,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 18:34:02,269 INFO L168 Benchmark]: Toolchain (without parser) took 5950.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -448.3 MB). Peak memory consumption was 280.0 MB. Max. memory is 7.1 GB. [2018-11-14 18:34:02,271 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:34:02,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 18:34:02,273 INFO L168 Benchmark]: Boogie Preprocessor took 38.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:34:02,273 INFO L168 Benchmark]: RCFGBuilder took 563.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-14 18:34:02,274 INFO L168 Benchmark]: TraceAbstraction took 5072.46 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 316.3 MB). Peak memory consumption was 316.3 MB. Max. memory is 7.1 GB. [2018-11-14 18:34:02,278 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 270.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 563.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5072.46 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 316.3 MB). Peak memory consumption was 316.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2018-11-14 18:34:02,285 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 [2018-11-14 18:34:02,285 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvslt32 Derived loop invariant: NULL - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 4.9s OverallTime, 5 OverallIterations, 11 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 65 SDtfs, 22 SDslu, 119 SDs, 0 SdLazy, 106 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 22 NumberOfFragments, 20 HoareAnnotationTreeSize, 11 FomulaSimplifications, 129 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 99 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 6621 SizeOfPredicates, 5 NumberOfNonLiveVariables, 112 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 155/211 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...