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/ddlm2013_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:38:37,008 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:38:37,011 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:38:37,026 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:38:37,026 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:38:37,027 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:38:37,028 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:38:37,030 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:38:37,032 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:38:37,033 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:38:37,034 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:38:37,034 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:38:37,035 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:38:37,036 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:38:37,037 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:38:37,038 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:38:37,039 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:38:37,041 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:38:37,043 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:38:37,044 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:38:37,046 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:38:37,047 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:38:37,049 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:38:37,049 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:38:37,050 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:38:37,051 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:38:37,052 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:38:37,052 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:38:37,053 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:38:37,054 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:38:37,054 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:38:37,055 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:38:37,055 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:38:37,056 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:38:37,057 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:38:37,057 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:38:37,058 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:38:37,085 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:38:37,085 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:38:37,086 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:38:37,086 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:38:37,087 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:38:37,087 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:38:37,087 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:38:37,088 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:38:37,088 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:38:37,088 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:38:37,088 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:38:37,088 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:38:37,088 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:38:37,091 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:38:37,091 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:38:37,091 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:38:37,091 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:38:37,091 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:38:37,093 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:38:37,093 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:38:37,093 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:38:37,093 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:38:37,093 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:38:37,094 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:38:37,094 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:38:37,094 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:38:37,094 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:38:37,095 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:38:37,095 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:38:37,095 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:38:37,095 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:38:37,095 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:38:37,096 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:38:37,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:38:37,186 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:38:37,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:38:37,193 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:38:37,193 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:38:37,194 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/ddlm2013_true-unreach-call.i [2018-11-23 11:38:37,256 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/872ae5f75/2264e6c2c5284efe8365d099f4bb4ce3/FLAGeb13cf074 [2018-11-23 11:38:37,663 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:38:37,664 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/ddlm2013_true-unreach-call.i [2018-11-23 11:38:37,669 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/872ae5f75/2264e6c2c5284efe8365d099f4bb4ce3/FLAGeb13cf074 [2018-11-23 11:38:38,038 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/872ae5f75/2264e6c2c5284efe8365d099f4bb4ce3 [2018-11-23 11:38:38,047 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:38:38,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:38:38,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:38:38,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:38:38,054 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:38:38,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:38:38" (1/1) ... [2018-11-23 11:38:38,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eedaf28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:38, skipping insertion in model container [2018-11-23 11:38:38,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:38:38" (1/1) ... [2018-11-23 11:38:38,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:38:38,096 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:38:38,342 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:38:38,348 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:38:38,367 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:38:38,387 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:38:38,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:38 WrapperNode [2018-11-23 11:38:38,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:38:38,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:38:38,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:38:38,389 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:38:38,396 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:38:38" (1/1) ... [2018-11-23 11:38:38,404 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:38:38" (1/1) ... [2018-11-23 11:38:38,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:38:38,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:38:38,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:38:38,413 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:38:38,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:38" (1/1) ... [2018-11-23 11:38:38,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:38" (1/1) ... [2018-11-23 11:38:38,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:38" (1/1) ... [2018-11-23 11:38:38,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:38" (1/1) ... [2018-11-23 11:38:38,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:38" (1/1) ... [2018-11-23 11:38:38,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:38" (1/1) ... [2018-11-23 11:38:38,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:38" (1/1) ... [2018-11-23 11:38:38,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:38:38,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:38:38,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:38:38,443 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:38:38,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:38" (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:38:38,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:38:38,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:38:38,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:38:38,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:38:38,562 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:38:38,562 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:38:38,563 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:38:38,563 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:38:39,030 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:38:39,030 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:38:39,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:39 BoogieIcfgContainer [2018-11-23 11:38:39,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:38:39,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:38:39,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:38:39,037 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:38:39,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:38:38" (1/3) ... [2018-11-23 11:38:39,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2182fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:38:39, skipping insertion in model container [2018-11-23 11:38:39,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:38" (2/3) ... [2018-11-23 11:38:39,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2182fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:38:39, skipping insertion in model container [2018-11-23 11:38:39,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:39" (3/3) ... [2018-11-23 11:38:39,041 INFO L112 eAbstractionObserver]: Analyzing ICFG ddlm2013_true-unreach-call.i [2018-11-23 11:38:39,049 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:38:39,057 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:38:39,074 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:38:39,110 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:38:39,111 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:38:39,111 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:38:39,112 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:38:39,114 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:38:39,114 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:38:39,114 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:38:39,115 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:38:39,115 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:38:39,141 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 11:38:39,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 11:38:39,148 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:39,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:39,151 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:39,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:39,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1176186358, now seen corresponding path program 1 times [2018-11-23 11:38:39,162 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:39,162 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:38:39,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:39,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:39,509 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 11:38:39,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 11:38:39,513 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #49#return; {24#true} is VALID [2018-11-23 11:38:39,514 INFO L256 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2018-11-23 11:38:39,515 INFO L273 TraceCheckUtils]: 4: Hoare triple {24#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0bv32;~b~0 := 0bv32;~j~0 := 1bv32; {41#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:38:39,520 INFO L273 TraceCheckUtils]: 5: Hoare triple {41#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume 0bv32 != ~flag~0;~i~0 := 0bv32; {41#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:38:39,522 INFO L273 TraceCheckUtils]: 6: Hoare triple {41#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {41#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:38:39,531 INFO L273 TraceCheckUtils]: 7: Hoare triple {41#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} assume 0bv32 != ~flag~0; {41#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} is VALID [2018-11-23 11:38:39,548 INFO L256 TraceCheckUtils]: 8: Hoare triple {41#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)))} call __VERIFIER_assert((if ~a~0 == ~b~0 then 1bv32 else 0bv32)); {54#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:39,557 INFO L273 TraceCheckUtils]: 9: Hoare triple {54#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {58#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:39,570 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {25#false} is VALID [2018-11-23 11:38:39,571 INFO L273 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 11:38:39,575 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:38:39,575 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:39,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:39,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:38:39,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 11:38:39,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:39,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:38:39,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:39,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:38:39,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:38:39,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:38:39,738 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2018-11-23 11:38:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:40,249 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2018-11-23 11:38:40,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:38:40,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 11:38:40,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:38:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-11-23 11:38:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:38:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-11-23 11:38:40,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2018-11-23 11:38:40,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:40,508 INFO L225 Difference]: With dead ends: 44 [2018-11-23 11:38:40,508 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 11:38:40,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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:38:40,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 11:38:40,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 11:38:40,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:40,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 11:38:40,555 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:38:40,555 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:38:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:40,559 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-23 11:38:40,560 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 11:38:40,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:40,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:40,561 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:38:40,561 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:38:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:40,564 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-23 11:38:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 11:38:40,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:40,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:40,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:40,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:38:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-23 11:38:40,575 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2018-11-23 11:38:40,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:40,576 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-23 11:38:40,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:38:40,576 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 11:38:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:38:40,577 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:40,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:40,577 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:40,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:40,579 INFO L82 PathProgramCache]: Analyzing trace with hash -505014087, now seen corresponding path program 1 times [2018-11-23 11:38:40,579 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:40,579 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:38:40,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:40,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:41,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {171#true} call ULTIMATE.init(); {171#true} is VALID [2018-11-23 11:38:41,209 INFO L273 TraceCheckUtils]: 1: Hoare triple {171#true} assume true; {171#true} is VALID [2018-11-23 11:38:41,209 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {171#true} {171#true} #49#return; {171#true} is VALID [2018-11-23 11:38:41,210 INFO L256 TraceCheckUtils]: 3: Hoare triple {171#true} call #t~ret5 := main(); {171#true} is VALID [2018-11-23 11:38:41,211 INFO L273 TraceCheckUtils]: 4: Hoare triple {171#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0bv32;~b~0 := 0bv32;~j~0 := 1bv32; {188#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:41,215 INFO L273 TraceCheckUtils]: 5: Hoare triple {188#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume 0bv32 != ~flag~0;~i~0 := 0bv32; {192#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:41,218 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;~b~0 := ~bvadd32(~b~0, ~bvsub32(~j~0, ~i~0));~i~0 := ~bvadd32(2bv32, ~i~0); {196#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) main_~a~0))} is VALID [2018-11-23 11:38:41,219 INFO L273 TraceCheckUtils]: 7: Hoare triple {196#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) main_~a~0))} assume 0bv32 == ~bvurem32(~i~0, 2bv32);~j~0 := ~bvadd32(2bv32, ~j~0); {196#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) main_~a~0))} is VALID [2018-11-23 11:38:41,238 INFO L273 TraceCheckUtils]: 8: Hoare triple {196#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) main_~a~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {196#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) main_~a~0))} is VALID [2018-11-23 11:38:41,252 INFO L273 TraceCheckUtils]: 9: Hoare triple {196#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) main_~a~0))} assume 0bv32 != ~flag~0; {196#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) main_~a~0))} is VALID [2018-11-23 11:38:41,254 INFO L256 TraceCheckUtils]: 10: Hoare triple {196#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) main_~a~0))} call __VERIFIER_assert((if ~a~0 == ~b~0 then 1bv32 else 0bv32)); {209#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:41,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {209#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {213#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:41,255 INFO L273 TraceCheckUtils]: 12: Hoare triple {213#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {172#false} is VALID [2018-11-23 11:38:41,256 INFO L273 TraceCheckUtils]: 13: Hoare triple {172#false} assume !false; {172#false} is VALID [2018-11-23 11:38:41,257 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:38:41,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:41,847 INFO L273 TraceCheckUtils]: 13: Hoare triple {172#false} assume !false; {172#false} is VALID [2018-11-23 11:38:41,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {223#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {172#false} is VALID [2018-11-23 11:38:41,873 INFO L273 TraceCheckUtils]: 11: Hoare triple {227#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {223#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:38:41,891 INFO L256 TraceCheckUtils]: 10: Hoare triple {231#(= main_~a~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~b~0 then 1bv32 else 0bv32)); {227#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:38:41,900 INFO L273 TraceCheckUtils]: 9: Hoare triple {231#(= main_~a~0 main_~b~0)} assume 0bv32 != ~flag~0; {231#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:38:41,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {231#(= main_~a~0 main_~b~0)} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {231#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:38:41,926 INFO L273 TraceCheckUtils]: 7: Hoare triple {231#(= main_~a~0 main_~b~0)} assume 0bv32 == ~bvurem32(~i~0, 2bv32);~j~0 := ~bvadd32(2bv32, ~j~0); {231#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:38:41,939 INFO L273 TraceCheckUtils]: 6: Hoare triple {244#(= (bvadd (bvneg main_~i~0) main_~b~0 main_~j~0 (_ bv4294967295 32)) main_~a~0)} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;~b~0 := ~bvadd32(~b~0, ~bvsub32(~j~0, ~i~0));~i~0 := ~bvadd32(2bv32, ~i~0); {231#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:38:43,971 INFO L273 TraceCheckUtils]: 5: Hoare triple {248#(= (bvadd main_~a~0 (_ bv1 32)) (bvadd main_~b~0 main_~j~0))} assume 0bv32 != ~flag~0;~i~0 := 0bv32; {244#(= (bvadd (bvneg main_~i~0) main_~b~0 main_~j~0 (_ bv4294967295 32)) main_~a~0)} is UNKNOWN [2018-11-23 11:38:43,972 INFO L273 TraceCheckUtils]: 4: Hoare triple {171#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0bv32;~b~0 := 0bv32;~j~0 := 1bv32; {248#(= (bvadd main_~a~0 (_ bv1 32)) (bvadd main_~b~0 main_~j~0))} is VALID [2018-11-23 11:38:43,972 INFO L256 TraceCheckUtils]: 3: Hoare triple {171#true} call #t~ret5 := main(); {171#true} is VALID [2018-11-23 11:38:43,973 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {171#true} {171#true} #49#return; {171#true} is VALID [2018-11-23 11:38:43,973 INFO L273 TraceCheckUtils]: 1: Hoare triple {171#true} assume true; {171#true} is VALID [2018-11-23 11:38:43,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {171#true} call ULTIMATE.init(); {171#true} is VALID [2018-11-23 11:38:43,974 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:38:43,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:43,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:38:43,979 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-11-23 11:38:43,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:43,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:38:46,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 22 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:46,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:38:46,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:38:46,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:38:46,086 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 12 states. [2018-11-23 11:38:46,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:46,732 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 11:38:46,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:38:46,733 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-11-23 11:38:46,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2018-11-23 11:38:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:38:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2018-11-23 11:38:46,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 27 transitions. [2018-11-23 11:38:46,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:46,786 INFO L225 Difference]: With dead ends: 24 [2018-11-23 11:38:46,786 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 11:38:46,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:38:46,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 11:38:46,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-23 11:38:46,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:46,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2018-11-23 11:38:46,794 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2018-11-23 11:38:46,794 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2018-11-23 11:38:46,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:46,797 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-11-23 11:38:46,797 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2018-11-23 11:38:46,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:46,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:46,798 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2018-11-23 11:38:46,798 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2018-11-23 11:38:46,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:46,800 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-11-23 11:38:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2018-11-23 11:38:46,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:46,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:46,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:46,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:38:46,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-23 11:38:46,804 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2018-11-23 11:38:46,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:46,804 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-23 11:38:46,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:38:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-11-23 11:38:46,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:38:46,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:46,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:46,806 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:46,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:46,806 INFO L82 PathProgramCache]: Analyzing trace with hash 175044283, now seen corresponding path program 1 times [2018-11-23 11:38:46,806 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:46,807 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:38:46,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:46,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:46,887 INFO L256 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {361#true} is VALID [2018-11-23 11:38:46,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {361#true} assume true; {361#true} is VALID [2018-11-23 11:38:46,888 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {361#true} {361#true} #49#return; {361#true} is VALID [2018-11-23 11:38:46,888 INFO L256 TraceCheckUtils]: 3: Hoare triple {361#true} call #t~ret5 := main(); {361#true} is VALID [2018-11-23 11:38:46,888 INFO L273 TraceCheckUtils]: 4: Hoare triple {361#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0bv32;~b~0 := 0bv32;~j~0 := 1bv32; {361#true} is VALID [2018-11-23 11:38:46,893 INFO L273 TraceCheckUtils]: 5: Hoare triple {361#true} assume !(0bv32 != ~flag~0);~i~0 := 1bv32; {381#(= main_~flag~0 (_ bv0 32))} is VALID [2018-11-23 11:38:46,893 INFO L273 TraceCheckUtils]: 6: Hoare triple {381#(= main_~flag~0 (_ bv0 32))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;~b~0 := ~bvadd32(~b~0, ~bvsub32(~j~0, ~i~0));~i~0 := ~bvadd32(2bv32, ~i~0); {381#(= main_~flag~0 (_ bv0 32))} is VALID [2018-11-23 11:38:46,896 INFO L273 TraceCheckUtils]: 7: Hoare triple {381#(= main_~flag~0 (_ bv0 32))} assume 0bv32 == ~bvurem32(~i~0, 2bv32);~j~0 := ~bvadd32(2bv32, ~j~0); {381#(= main_~flag~0 (_ bv0 32))} is VALID [2018-11-23 11:38:46,899 INFO L273 TraceCheckUtils]: 8: Hoare triple {381#(= main_~flag~0 (_ bv0 32))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {381#(= main_~flag~0 (_ bv0 32))} is VALID [2018-11-23 11:38:46,899 INFO L273 TraceCheckUtils]: 9: Hoare triple {381#(= main_~flag~0 (_ bv0 32))} assume 0bv32 != ~flag~0; {362#false} is VALID [2018-11-23 11:38:46,899 INFO L256 TraceCheckUtils]: 10: Hoare triple {362#false} call __VERIFIER_assert((if ~a~0 == ~b~0 then 1bv32 else 0bv32)); {362#false} is VALID [2018-11-23 11:38:46,900 INFO L273 TraceCheckUtils]: 11: Hoare triple {362#false} ~cond := #in~cond; {362#false} is VALID [2018-11-23 11:38:46,900 INFO L273 TraceCheckUtils]: 12: Hoare triple {362#false} assume 0bv32 == ~cond; {362#false} is VALID [2018-11-23 11:38:46,900 INFO L273 TraceCheckUtils]: 13: Hoare triple {362#false} assume !false; {362#false} is VALID [2018-11-23 11:38:46,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:38:46,901 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:38:46,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:46,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:38:46,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:38:46,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:46,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:38:46,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:46,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:38:46,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:38:46,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:38:46,927 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 3 states. [2018-11-23 11:38:46,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:46,994 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 11:38:46,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:38:46,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:38:46,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:38:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 11:38:46,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:38:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 11:38:47,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2018-11-23 11:38:47,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:47,066 INFO L225 Difference]: With dead ends: 26 [2018-11-23 11:38:47,066 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 11:38:47,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-23 11:38:47,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 11:38:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 11:38:47,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:47,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 11:38:47,076 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:38:47,077 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:38:47,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:47,078 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-23 11:38:47,079 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-23 11:38:47,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:47,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:47,079 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:38:47,080 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:38:47,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:47,082 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-23 11:38:47,082 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-23 11:38:47,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:47,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:47,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:47,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:47,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:38:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-23 11:38:47,085 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2018-11-23 11:38:47,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:47,085 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 11:38:47,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:38:47,085 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-23 11:38:47,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:38:47,086 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:47,086 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:47,086 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:47,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:47,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1230938436, now seen corresponding path program 2 times [2018-11-23 11:38:47,087 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:47,087 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:38:47,109 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:38:47,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:38:47,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:38:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:47,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:47,506 INFO L256 TraceCheckUtils]: 0: Hoare triple {496#true} call ULTIMATE.init(); {496#true} is VALID [2018-11-23 11:38:47,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {496#true} assume true; {496#true} is VALID [2018-11-23 11:38:47,507 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {496#true} {496#true} #49#return; {496#true} is VALID [2018-11-23 11:38:47,508 INFO L256 TraceCheckUtils]: 3: Hoare triple {496#true} call #t~ret5 := main(); {496#true} is VALID [2018-11-23 11:38:47,509 INFO L273 TraceCheckUtils]: 4: Hoare triple {496#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0bv32;~b~0 := 0bv32;~j~0 := 1bv32; {513#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:47,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {513#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume 0bv32 != ~flag~0;~i~0 := 0bv32; {517#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:47,520 INFO L273 TraceCheckUtils]: 6: Hoare triple {517#(and (= main_~b~0 (_ bv0 32)) (= main_~a~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;~b~0 := ~bvadd32(~b~0, ~bvsub32(~j~0, ~i~0));~i~0 := ~bvadd32(2bv32, ~i~0); {521#(and (= (_ bv1 32) main_~a~0) (= main_~j~0 main_~b~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:47,521 INFO L273 TraceCheckUtils]: 7: Hoare triple {521#(and (= (_ bv1 32) main_~a~0) (= main_~j~0 main_~b~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~i~0, 2bv32);~j~0 := ~bvadd32(2bv32, ~j~0); {525#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) main_~a~0) (= (bvadd main_~j~0 (_ bv4294967294 32)) main_~b~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:47,523 INFO L273 TraceCheckUtils]: 8: Hoare triple {525#(and (= (bvadd main_~b~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) main_~a~0) (= (bvadd main_~j~0 (_ bv4294967294 32)) main_~b~0) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;~b~0 := ~bvadd32(~b~0, ~bvsub32(~j~0, ~i~0));~i~0 := ~bvadd32(2bv32, ~i~0); {529#(and (= (_ bv2 32) main_~a~0) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:47,524 INFO L273 TraceCheckUtils]: 9: Hoare triple {529#(and (= (_ bv2 32) main_~a~0) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume 0bv32 == ~bvurem32(~i~0, 2bv32);~j~0 := ~bvadd32(2bv32, ~j~0); {529#(and (= (_ bv2 32) main_~a~0) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:47,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {529#(and (= (_ bv2 32) main_~a~0) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {529#(and (= (_ bv2 32) main_~a~0) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:47,537 INFO L273 TraceCheckUtils]: 11: Hoare triple {529#(and (= (_ bv2 32) main_~a~0) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} assume 0bv32 != ~flag~0; {529#(and (= (_ bv2 32) main_~a~0) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:47,539 INFO L256 TraceCheckUtils]: 12: Hoare triple {529#(and (= (_ bv2 32) main_~a~0) (= (bvadd main_~b~0 (_ bv4294967294 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~a~0 == ~b~0 then 1bv32 else 0bv32)); {542#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:47,542 INFO L273 TraceCheckUtils]: 13: Hoare triple {542#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {546#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:47,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {546#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {497#false} is VALID [2018-11-23 11:38:47,543 INFO L273 TraceCheckUtils]: 15: Hoare triple {497#false} assume !false; {497#false} is VALID [2018-11-23 11:38:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:47,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:49,980 INFO L273 TraceCheckUtils]: 15: Hoare triple {497#false} assume !false; {497#false} is VALID [2018-11-23 11:38:49,981 INFO L273 TraceCheckUtils]: 14: Hoare triple {556#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {497#false} is VALID [2018-11-23 11:38:49,982 INFO L273 TraceCheckUtils]: 13: Hoare triple {560#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {556#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:38:49,983 INFO L256 TraceCheckUtils]: 12: Hoare triple {564#(= main_~a~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~b~0 then 1bv32 else 0bv32)); {560#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:38:49,984 INFO L273 TraceCheckUtils]: 11: Hoare triple {564#(= main_~a~0 main_~b~0)} assume 0bv32 != ~flag~0; {564#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:38:49,985 INFO L273 TraceCheckUtils]: 10: Hoare triple {564#(= main_~a~0 main_~b~0)} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {564#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:38:49,986 INFO L273 TraceCheckUtils]: 9: Hoare triple {564#(= main_~a~0 main_~b~0)} assume 0bv32 == ~bvurem32(~i~0, 2bv32);~j~0 := ~bvadd32(2bv32, ~j~0); {564#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:38:50,008 INFO L273 TraceCheckUtils]: 8: Hoare triple {577#(= (bvadd main_~a~0 (_ bv1 32)) (bvadd (bvneg main_~i~0) main_~b~0 main_~j~0))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;~b~0 := ~bvadd32(~b~0, ~bvsub32(~j~0, ~i~0));~i~0 := ~bvadd32(2bv32, ~i~0); {564#(= main_~a~0 main_~b~0)} is VALID [2018-11-23 11:38:52,012 INFO L273 TraceCheckUtils]: 7: Hoare triple {581#(= (bvadd (bvneg main_~i~0) main_~b~0 main_~j~0 (_ bv1 32)) main_~a~0)} assume 0bv32 == ~bvurem32(~i~0, 2bv32);~j~0 := ~bvadd32(2bv32, ~j~0); {577#(= (bvadd main_~a~0 (_ bv1 32)) (bvadd (bvneg main_~i~0) main_~b~0 main_~j~0))} is UNKNOWN [2018-11-23 11:38:54,016 INFO L273 TraceCheckUtils]: 6: Hoare triple {585#(= (bvadd (bvneg (bvadd main_~i~0 (_ bv2 32))) (bvneg main_~i~0) main_~b~0 (bvmul (_ bv2 32) main_~j~0)) main_~a~0)} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;~b~0 := ~bvadd32(~b~0, ~bvsub32(~j~0, ~i~0));~i~0 := ~bvadd32(2bv32, ~i~0); {581#(= (bvadd (bvneg main_~i~0) main_~b~0 main_~j~0 (_ bv1 32)) main_~a~0)} is UNKNOWN [2018-11-23 11:38:54,063 INFO L273 TraceCheckUtils]: 5: Hoare triple {589#(= (bvadd main_~a~0 (_ bv2 32)) (bvadd main_~b~0 (bvmul (_ bv2 32) main_~j~0)))} assume 0bv32 != ~flag~0;~i~0 := 0bv32; {585#(= (bvadd (bvneg (bvadd main_~i~0 (_ bv2 32))) (bvneg main_~i~0) main_~b~0 (bvmul (_ bv2 32) main_~j~0)) main_~a~0)} is VALID [2018-11-23 11:38:54,064 INFO L273 TraceCheckUtils]: 4: Hoare triple {496#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0bv32;~b~0 := 0bv32;~j~0 := 1bv32; {589#(= (bvadd main_~a~0 (_ bv2 32)) (bvadd main_~b~0 (bvmul (_ bv2 32) main_~j~0)))} is VALID [2018-11-23 11:38:54,064 INFO L256 TraceCheckUtils]: 3: Hoare triple {496#true} call #t~ret5 := main(); {496#true} is VALID [2018-11-23 11:38:54,065 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {496#true} {496#true} #49#return; {496#true} is VALID [2018-11-23 11:38:54,065 INFO L273 TraceCheckUtils]: 1: Hoare triple {496#true} assume true; {496#true} is VALID [2018-11-23 11:38:54,065 INFO L256 TraceCheckUtils]: 0: Hoare triple {496#true} call ULTIMATE.init(); {496#true} is VALID [2018-11-23 11:38:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:54,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:54,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:38:54,069 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-11-23 11:38:54,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:54,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:38:58,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 25 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:58,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:38:58,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:38:58,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:38:58,187 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 16 states. [2018-11-23 11:38:59,084 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2018-11-23 11:39:02,569 WARN L180 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-11-23 11:39:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:03,735 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-11-23 11:39:03,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:39:03,736 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-11-23 11:39:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:39:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2018-11-23 11:39:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:39:03,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2018-11-23 11:39:03,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 50 transitions. [2018-11-23 11:39:06,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:06,885 INFO L225 Difference]: With dead ends: 42 [2018-11-23 11:39:06,885 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:39:06,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:39:06,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:39:06,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-11-23 11:39:06,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:06,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 19 states. [2018-11-23 11:39:06,891 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 19 states. [2018-11-23 11:39:06,892 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 19 states. [2018-11-23 11:39:06,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:06,894 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 11:39:06,894 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 11:39:06,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:06,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:06,895 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 23 states. [2018-11-23 11:39:06,895 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 23 states. [2018-11-23 11:39:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:06,897 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 11:39:06,897 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 11:39:06,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:06,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:06,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:06,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:39:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 11:39:06,900 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2018-11-23 11:39:06,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:06,900 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 11:39:06,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:39:06,901 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 11:39:06,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:39:06,901 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:39:06,901 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:39:06,902 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:39:06,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:39:06,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1915489793, now seen corresponding path program 1 times [2018-11-23 11:39:06,902 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:39:06,902 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-23 11:39:06,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:39:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:39:06,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:39:06,988 INFO L256 TraceCheckUtils]: 0: Hoare triple {743#true} call ULTIMATE.init(); {743#true} is VALID [2018-11-23 11:39:06,988 INFO L273 TraceCheckUtils]: 1: Hoare triple {743#true} assume true; {743#true} is VALID [2018-11-23 11:39:06,989 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {743#true} {743#true} #49#return; {743#true} is VALID [2018-11-23 11:39:06,989 INFO L256 TraceCheckUtils]: 3: Hoare triple {743#true} call #t~ret5 := main(); {743#true} is VALID [2018-11-23 11:39:06,989 INFO L273 TraceCheckUtils]: 4: Hoare triple {743#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0bv32;~b~0 := 0bv32;~j~0 := 1bv32; {743#true} is VALID [2018-11-23 11:39:06,990 INFO L273 TraceCheckUtils]: 5: Hoare triple {743#true} assume 0bv32 != ~flag~0;~i~0 := 0bv32; {763#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:39:06,992 INFO L273 TraceCheckUtils]: 6: Hoare triple {763#(= main_~i~0 (_ bv0 32))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;~b~0 := ~bvadd32(~b~0, ~bvsub32(~j~0, ~i~0));~i~0 := ~bvadd32(2bv32, ~i~0); {767#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:06,993 INFO L273 TraceCheckUtils]: 7: Hoare triple {767#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume 0bv32 == ~bvurem32(~i~0, 2bv32);~j~0 := ~bvadd32(2bv32, ~j~0); {767#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:06,996 INFO L273 TraceCheckUtils]: 8: Hoare triple {767#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;~b~0 := ~bvadd32(~b~0, ~bvsub32(~j~0, ~i~0));~i~0 := ~bvadd32(2bv32, ~i~0); {774#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:39:06,997 INFO L273 TraceCheckUtils]: 9: Hoare triple {774#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !(0bv32 == ~bvurem32(~i~0, 2bv32));#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {744#false} is VALID [2018-11-23 11:39:06,997 INFO L273 TraceCheckUtils]: 10: Hoare triple {744#false} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;~b~0 := ~bvadd32(~b~0, ~bvsub32(~j~0, ~i~0));~i~0 := ~bvadd32(2bv32, ~i~0); {744#false} is VALID [2018-11-23 11:39:06,998 INFO L273 TraceCheckUtils]: 11: Hoare triple {744#false} assume 0bv32 == ~bvurem32(~i~0, 2bv32);~j~0 := ~bvadd32(2bv32, ~j~0); {744#false} is VALID [2018-11-23 11:39:06,998 INFO L273 TraceCheckUtils]: 12: Hoare triple {744#false} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {744#false} is VALID [2018-11-23 11:39:06,998 INFO L273 TraceCheckUtils]: 13: Hoare triple {744#false} assume 0bv32 != ~flag~0; {744#false} is VALID [2018-11-23 11:39:06,999 INFO L256 TraceCheckUtils]: 14: Hoare triple {744#false} call __VERIFIER_assert((if ~a~0 == ~b~0 then 1bv32 else 0bv32)); {744#false} is VALID [2018-11-23 11:39:06,999 INFO L273 TraceCheckUtils]: 15: Hoare triple {744#false} ~cond := #in~cond; {744#false} is VALID [2018-11-23 11:39:06,999 INFO L273 TraceCheckUtils]: 16: Hoare triple {744#false} assume 0bv32 == ~cond; {744#false} is VALID [2018-11-23 11:39:06,999 INFO L273 TraceCheckUtils]: 17: Hoare triple {744#false} assume !false; {744#false} is VALID [2018-11-23 11:39:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:39:07,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:39:07,084 INFO L273 TraceCheckUtils]: 17: Hoare triple {744#false} assume !false; {744#false} is VALID [2018-11-23 11:39:07,085 INFO L273 TraceCheckUtils]: 16: Hoare triple {744#false} assume 0bv32 == ~cond; {744#false} is VALID [2018-11-23 11:39:07,085 INFO L273 TraceCheckUtils]: 15: Hoare triple {744#false} ~cond := #in~cond; {744#false} is VALID [2018-11-23 11:39:07,086 INFO L256 TraceCheckUtils]: 14: Hoare triple {744#false} call __VERIFIER_assert((if ~a~0 == ~b~0 then 1bv32 else 0bv32)); {744#false} is VALID [2018-11-23 11:39:07,086 INFO L273 TraceCheckUtils]: 13: Hoare triple {744#false} assume 0bv32 != ~flag~0; {744#false} is VALID [2018-11-23 11:39:07,086 INFO L273 TraceCheckUtils]: 12: Hoare triple {744#false} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {744#false} is VALID [2018-11-23 11:39:07,087 INFO L273 TraceCheckUtils]: 11: Hoare triple {744#false} assume 0bv32 == ~bvurem32(~i~0, 2bv32);~j~0 := ~bvadd32(2bv32, ~j~0); {744#false} is VALID [2018-11-23 11:39:07,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {744#false} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;~b~0 := ~bvadd32(~b~0, ~bvsub32(~j~0, ~i~0));~i~0 := ~bvadd32(2bv32, ~i~0); {744#false} is VALID [2018-11-23 11:39:07,091 INFO L273 TraceCheckUtils]: 9: Hoare triple {826#(= (_ bv0 32) (bvurem main_~i~0 (_ bv2 32)))} assume !(0bv32 == ~bvurem32(~i~0, 2bv32));#t~post4 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {744#false} is VALID [2018-11-23 11:39:07,094 INFO L273 TraceCheckUtils]: 8: Hoare triple {826#(= (_ bv0 32) (bvurem main_~i~0 (_ bv2 32)))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;~b~0 := ~bvadd32(~b~0, ~bvsub32(~j~0, ~i~0));~i~0 := ~bvadd32(2bv32, ~i~0); {826#(= (_ bv0 32) (bvurem main_~i~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:07,094 INFO L273 TraceCheckUtils]: 7: Hoare triple {826#(= (_ bv0 32) (bvurem main_~i~0 (_ bv2 32)))} assume 0bv32 == ~bvurem32(~i~0, 2bv32);~j~0 := ~bvadd32(2bv32, ~j~0); {826#(= (_ bv0 32) (bvurem main_~i~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:07,096 INFO L273 TraceCheckUtils]: 6: Hoare triple {826#(= (_ bv0 32) (bvurem main_~i~0 (_ bv2 32)))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;#t~post3 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3;~b~0 := ~bvadd32(~b~0, ~bvsub32(~j~0, ~i~0));~i~0 := ~bvadd32(2bv32, ~i~0); {826#(= (_ bv0 32) (bvurem main_~i~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:07,097 INFO L273 TraceCheckUtils]: 5: Hoare triple {743#true} assume 0bv32 != ~flag~0;~i~0 := 0bv32; {826#(= (_ bv0 32) (bvurem main_~i~0 (_ bv2 32)))} is VALID [2018-11-23 11:39:07,098 INFO L273 TraceCheckUtils]: 4: Hoare triple {743#true} havoc ~i~0;havoc ~j~0;havoc ~a~0;havoc ~b~0;~flag~0 := #t~nondet1;havoc #t~nondet1;~a~0 := 0bv32;~b~0 := 0bv32;~j~0 := 1bv32; {743#true} is VALID [2018-11-23 11:39:07,098 INFO L256 TraceCheckUtils]: 3: Hoare triple {743#true} call #t~ret5 := main(); {743#true} is VALID [2018-11-23 11:39:07,099 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {743#true} {743#true} #49#return; {743#true} is VALID [2018-11-23 11:39:07,099 INFO L273 TraceCheckUtils]: 1: Hoare triple {743#true} assume true; {743#true} is VALID [2018-11-23 11:39:07,099 INFO L256 TraceCheckUtils]: 0: Hoare triple {743#true} call ULTIMATE.init(); {743#true} is VALID [2018-11-23 11:39:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:39:07,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:39:07,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-23 11:39:07,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 11:39:07,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:39:07,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:39:07,153 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:39:07,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:39:07,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:39:07,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:39:07,153 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 6 states. [2018-11-23 11:39:07,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:07,281 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-23 11:39:07,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:39:07,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 11:39:07,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:39:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:39:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-11-23 11:39:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:39:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-11-23 11:39:07,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2018-11-23 11:39:07,328 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:39:07,328 INFO L225 Difference]: With dead ends: 22 [2018-11-23 11:39:07,328 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:39:07,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:39:07,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:39:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:39:07,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:39:07,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:39:07,330 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:39:07,330 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:39:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:07,330 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:39:07,331 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:39:07,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:07,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:07,331 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:39:07,332 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:39:07,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:39:07,332 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:39:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:39:07,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:07,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:39:07,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:39:07,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:39:07,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:39:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:39:07,333 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-11-23 11:39:07,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:39:07,333 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:39:07,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:39:07,334 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:39:07,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:39:07,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:39:10,018 WARN L180 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 32 DAG size of output: 3 [2018-11-23 11:39:10,022 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:39:10,022 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:39:10,022 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:39:10,022 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:39:10,022 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:39:10,023 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:39:10,023 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 33) no Hoare annotation was computed. [2018-11-23 11:39:10,023 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 29) no Hoare annotation was computed. [2018-11-23 11:39:10,023 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 35) no Hoare annotation was computed. [2018-11-23 11:39:10,023 INFO L448 ceAbstractionStarter]: For program point L25-2(lines 10 35) no Hoare annotation was computed. [2018-11-23 11:39:10,023 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 10 35) no Hoare annotation was computed. [2018-11-23 11:39:10,023 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 35) no Hoare annotation was computed. [2018-11-23 11:39:10,023 INFO L444 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (= main_~a~0 main_~b~0) [2018-11-23 11:39:10,024 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 35) the Hoare annotation is: true [2018-11-23 11:39:10,024 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2018-11-23 11:39:10,024 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 11:39:10,024 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:39:10,024 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 11:39:10,024 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 11:39:10,024 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 11:39:10,024 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:39:10,026 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:39:10,026 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 11:39:10,026 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:39:10,026 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:39:10,026 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:39:10,027 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 11:39:10,027 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2018-11-23 11:39:10,027 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:39:10,027 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:39:10,027 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:39:10,027 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2018-11-23 11:39:10,027 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2018-11-23 11:39:10,027 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2018-11-23 11:39:10,027 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:39:10,027 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:39:10,028 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 11:39:10,028 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-23 11:39:10,028 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-23 11:39:10,028 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 11:39:10,028 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2018-11-23 11:39:10,028 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:39:10,028 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-23 11:39:10,029 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-23 11:39:10,029 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:39:10,029 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:39:10,029 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:39:10,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:39:10 BoogieIcfgContainer [2018-11-23 11:39:10,031 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:39:10,032 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:39:10,032 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:39:10,032 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:39:10,033 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:39" (3/4) ... [2018-11-23 11:39:10,036 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:39:10,042 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:39:10,043 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:39:10,043 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:39:10,048 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-23 11:39:10,048 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 11:39:10,048 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:39:10,049 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:39:10,093 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-lit/ddlm2013_true-unreach-call.i-witness.graphml [2018-11-23 11:39:10,093 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:39:10,095 INFO L168 Benchmark]: Toolchain (without parser) took 32046.75 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -316.2 MB). Peak memory consumption was 402.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:39:10,096 INFO L168 Benchmark]: CDTParser took 0.21 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-23 11:39:10,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.27 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-23 11:39:10,097 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.33 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-23 11:39:10,097 INFO L168 Benchmark]: Boogie Preprocessor took 30.45 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-23 11:39:10,097 INFO L168 Benchmark]: RCFGBuilder took 588.71 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -762.0 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:39:10,098 INFO L168 Benchmark]: TraceAbstraction took 30998.69 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 435.3 MB). Peak memory consumption was 435.3 MB. Max. memory is 7.1 GB. [2018-11-23 11:39:10,099 INFO L168 Benchmark]: Witness Printer took 61.62 ms. Allocated memory is still 2.2 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:39:10,102 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.21 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 338.27 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 Procedure Inliner took 23.33 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. * Boogie Preprocessor took 30.45 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 588.71 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 718.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -762.0 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30998.69 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 435.3 MB). Peak memory consumption was 435.3 MB. Max. memory is 7.1 GB. * Witness Printer took 61.62 ms. Allocated memory is still 2.2 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 7.1 GB. * 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 30.9s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 10.5s AutomataDifference, 0.0s DeadEndRemovalTime, 2.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 69 SDtfs, 29 SDslu, 272 SDs, 0 SdLazy, 172 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, 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.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 15 PreInvPairs, 21 NumberOfFragments, 8 HoareAnnotationTreeSize, 15 FomulaSimplifications, 28 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 49 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 6038 SizeOfPredicates, 10 NumberOfNonLiveVariables, 162 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 17/29 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...