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/css2003_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:38:29,036 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:38:29,040 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:38:29,054 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:38:29,055 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:38:29,056 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:38:29,057 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:38:29,059 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:38:29,061 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:38:29,062 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:38:29,063 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:38:29,063 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:38:29,064 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:38:29,065 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:38:29,066 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:38:29,068 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:38:29,069 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:38:29,073 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:38:29,077 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:38:29,082 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:38:29,087 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:38:29,088 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:38:29,093 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:38:29,094 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:38:29,096 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:38:29,097 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:38:29,098 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:38:29,099 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:38:29,099 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:38:29,103 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:38:29,104 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:38:29,104 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:38:29,105 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:38:29,106 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:38:29,107 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:38:29,107 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:38:29,108 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:29,135 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:38:29,135 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:38:29,136 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:38:29,136 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:38:29,137 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:38:29,137 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:38:29,137 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:38:29,137 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:38:29,138 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:38:29,138 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:38:29,138 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:38:29,138 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:38:29,138 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:38:29,139 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:38:29,139 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:38:29,139 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:38:29,139 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:38:29,139 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:38:29,139 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:38:29,140 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:38:29,140 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:38:29,140 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:38:29,140 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:38:29,140 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:38:29,141 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:38:29,141 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:38:29,141 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:38:29,141 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:38:29,142 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:38:29,142 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:38:29,142 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:38:29,142 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:38:29,142 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:38:29,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:38:29,215 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:38:29,220 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:38:29,221 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:38:29,222 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:38:29,222 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/css2003_true-unreach-call_true-termination.c.i [2018-11-23 11:38:29,282 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe164b627/9dc219ec2b804412b3783638d648210d/FLAGed53023bc [2018-11-23 11:38:29,744 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:38:29,745 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/css2003_true-unreach-call_true-termination.c.i [2018-11-23 11:38:29,752 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe164b627/9dc219ec2b804412b3783638d648210d/FLAGed53023bc [2018-11-23 11:38:30,093 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe164b627/9dc219ec2b804412b3783638d648210d [2018-11-23 11:38:30,105 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:38:30,106 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:38:30,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:38:30,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:38:30,111 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:38:30,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:38:30" (1/1) ... [2018-11-23 11:38:30,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b15a6cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:30, skipping insertion in model container [2018-11-23 11:38:30,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:38:30" (1/1) ... [2018-11-23 11:38:30,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:38:30,156 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:38:30,417 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:38:30,427 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:38:30,449 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:38:30,466 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:38:30,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:30 WrapperNode [2018-11-23 11:38:30,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:38:30,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:38:30,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:38:30,468 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:38:30,477 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:30" (1/1) ... [2018-11-23 11:38:30,485 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:30" (1/1) ... [2018-11-23 11:38:30,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:38:30,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:38:30,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:38:30,491 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:38:30,501 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:30" (1/1) ... [2018-11-23 11:38:30,502 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:30" (1/1) ... [2018-11-23 11:38:30,503 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:30" (1/1) ... [2018-11-23 11:38:30,503 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:30" (1/1) ... [2018-11-23 11:38:30,511 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:30" (1/1) ... [2018-11-23 11:38:30,517 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:30" (1/1) ... [2018-11-23 11:38:30,519 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:30" (1/1) ... [2018-11-23 11:38:30,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:38:30,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:38:30,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:38:30,522 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:38:30,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:30" (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:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:38:30,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:38:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:38:30,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:38:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:38:30,647 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:38:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:38:30,647 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:38:31,097 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:38:31,097 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:38:31,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:31 BoogieIcfgContainer [2018-11-23 11:38:31,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:38:31,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:38:31,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:38:31,102 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:38:31,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:38:30" (1/3) ... [2018-11-23 11:38:31,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275a0f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:38:31, skipping insertion in model container [2018-11-23 11:38:31,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:38:30" (2/3) ... [2018-11-23 11:38:31,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@275a0f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:38:31, skipping insertion in model container [2018-11-23 11:38:31,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:38:31" (3/3) ... [2018-11-23 11:38:31,106 INFO L112 eAbstractionObserver]: Analyzing ICFG css2003_true-unreach-call_true-termination.c.i [2018-11-23 11:38:31,117 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:38:31,125 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:38:31,139 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:38:31,171 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:38:31,172 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:38:31,172 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:38:31,172 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:38:31,173 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:38:31,173 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:38:31,173 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:38:31,173 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:38:31,174 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:38:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 11:38:31,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:38:31,200 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:31,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:31,203 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:31,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:31,210 INFO L82 PathProgramCache]: Analyzing trace with hash 576882593, now seen corresponding path program 1 times [2018-11-23 11:38:31,214 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:31,215 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:31,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:31,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:31,987 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 11:38:31,994 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 11:38:31,995 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #36#return; {22#true} is VALID [2018-11-23 11:38:31,996 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2018-11-23 11:38:32,011 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 1bv32;~j~0 := 1bv32;~k~0 := #t~nondet1;havoc #t~nondet1; {39#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:32,025 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(~bvsle32(0bv32, ~k~0) && ~bvsle32(~k~0, 1bv32)); {43#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:32,036 INFO L273 TraceCheckUtils]: 6: Hoare triple {43#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 1000000bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(~j~0, ~k~0);~k~0 := ~bvsub32(~k~0, 1bv32); {47#(and (bvsle (bvadd main_~k~0 (_ bv1 32)) (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~k~0 (_ bv1 32))))} is VALID [2018-11-23 11:38:32,040 INFO L256 TraceCheckUtils]: 7: Hoare triple {47#(and (bvsle (bvadd main_~k~0 (_ bv1 32)) (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~k~0 (_ bv1 32))))} call __VERIFIER_assert((if (~bvsle32(1bv32, ~bvadd32(~i~0, ~k~0)) && ~bvsle32(~bvadd32(~i~0, ~k~0), 2bv32)) && ~bvsge32(~i~0, 1bv32) then 1bv32 else 0bv32)); {51#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:32,043 INFO L273 TraceCheckUtils]: 8: Hoare triple {51#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {55#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:32,044 INFO L273 TraceCheckUtils]: 9: Hoare triple {55#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {23#false} is VALID [2018-11-23 11:38:32,044 INFO L273 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 11:38:32,048 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:32,049 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:38:32,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:38:32,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:38:32,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-11-23 11:38:32,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:32,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:38:32,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:32,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:38:32,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:38:32,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:38:32,131 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 7 states. [2018-11-23 11:38:32,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:32,998 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2018-11-23 11:38:32,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:38:32,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-11-23 11:38:32,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:33,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:38:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2018-11-23 11:38:33,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:38:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2018-11-23 11:38:33,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 53 transitions. [2018-11-23 11:38:33,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:33,436 INFO L225 Difference]: With dead ends: 41 [2018-11-23 11:38:33,437 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:38:33,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:38:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:38:33,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-23 11:38:33,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:33,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 20 states. [2018-11-23 11:38:33,497 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 20 states. [2018-11-23 11:38:33,497 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 20 states. [2018-11-23 11:38:33,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:33,501 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:38:33,501 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:38:33,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:33,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:33,502 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states. [2018-11-23 11:38:33,502 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states. [2018-11-23 11:38:33,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:33,506 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:38:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:38:33,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:33,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:33,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:33,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:33,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:38:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-23 11:38:33,512 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 11 [2018-11-23 11:38:33,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:33,512 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-23 11:38:33,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:38:33,513 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 11:38:33,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:38:33,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:33,514 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:33,514 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:33,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:33,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1410667485, now seen corresponding path program 1 times [2018-11-23 11:38:33,515 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:33,516 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:33,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:38:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:38:33,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:38:34,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2018-11-23 11:38:34,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2018-11-23 11:38:34,153 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #36#return; {190#true} is VALID [2018-11-23 11:38:34,153 INFO L256 TraceCheckUtils]: 3: Hoare triple {190#true} call #t~ret2 := main(); {190#true} is VALID [2018-11-23 11:38:34,155 INFO L273 TraceCheckUtils]: 4: Hoare triple {190#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 1bv32;~j~0 := 1bv32;~k~0 := #t~nondet1;havoc #t~nondet1; {207#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:34,155 INFO L273 TraceCheckUtils]: 5: Hoare triple {207#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(~bvsle32(0bv32, ~k~0) && ~bvsle32(~k~0, 1bv32)); {211#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:38:34,161 INFO L273 TraceCheckUtils]: 6: Hoare triple {211#(and (bvsle (_ bv0 32) main_~k~0) (bvsle main_~k~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, 1000000bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(~j~0, ~k~0);~k~0 := ~bvsub32(~k~0, 1bv32); {215#(and (bvsle (bvadd main_~k~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv0 32) (bvadd main_~k~0 (_ bv1 32))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:38:34,162 INFO L256 TraceCheckUtils]: 7: Hoare triple {215#(and (bvsle (bvadd main_~k~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv0 32) (bvadd main_~k~0 (_ bv1 32))) (= (_ bv2 32) main_~i~0))} call __VERIFIER_assert((if (~bvsle32(1bv32, ~bvadd32(~i~0, ~k~0)) && ~bvsle32(~bvadd32(~i~0, ~k~0), 2bv32)) && ~bvsge32(~i~0, 1bv32) then 1bv32 else 0bv32)); {190#true} is VALID [2018-11-23 11:38:34,162 INFO L273 TraceCheckUtils]: 8: Hoare triple {190#true} ~cond := #in~cond; {222#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2018-11-23 11:38:34,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {222#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0bv32 == ~cond); {226#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:38:34,165 INFO L273 TraceCheckUtils]: 10: Hoare triple {226#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} assume true; {226#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:38:34,168 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {226#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} {215#(and (bvsle (bvadd main_~k~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv0 32) (bvadd main_~k~0 (_ bv1 32))) (= (_ bv2 32) main_~i~0))} #40#return; {215#(and (bvsle (bvadd main_~k~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv0 32) (bvadd main_~k~0 (_ bv1 32))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:38:34,171 INFO L273 TraceCheckUtils]: 12: Hoare triple {215#(and (bvsle (bvadd main_~k~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv0 32) (bvadd main_~k~0 (_ bv1 32))) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, 1000000bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(~j~0, ~k~0);~k~0 := ~bvsub32(~k~0, 1bv32); {236#(and (bvsle (bvadd main_~k~0 (_ bv2 32)) (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~k~0 (_ bv2 32))))} is VALID [2018-11-23 11:38:34,174 INFO L256 TraceCheckUtils]: 13: Hoare triple {236#(and (bvsle (bvadd main_~k~0 (_ bv2 32)) (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~k~0 (_ bv2 32))))} call __VERIFIER_assert((if (~bvsle32(1bv32, ~bvadd32(~i~0, ~k~0)) && ~bvsle32(~bvadd32(~i~0, ~k~0), 2bv32)) && ~bvsge32(~i~0, 1bv32) then 1bv32 else 0bv32)); {240#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:34,175 INFO L273 TraceCheckUtils]: 14: Hoare triple {240#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {244#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:38:34,175 INFO L273 TraceCheckUtils]: 15: Hoare triple {244#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {191#false} is VALID [2018-11-23 11:38:34,176 INFO L273 TraceCheckUtils]: 16: Hoare triple {191#false} assume !false; {191#false} is VALID [2018-11-23 11:38:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:34,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:38:35,511 INFO L273 TraceCheckUtils]: 16: Hoare triple {191#false} assume !false; {191#false} is VALID [2018-11-23 11:38:35,512 INFO L273 TraceCheckUtils]: 15: Hoare triple {254#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {191#false} is VALID [2018-11-23 11:38:35,513 INFO L273 TraceCheckUtils]: 14: Hoare triple {226#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {254#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:38:35,515 INFO L256 TraceCheckUtils]: 13: Hoare triple {261#(and (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0)) (bvsge main_~i~0 (_ bv1 32)) (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32)))} call __VERIFIER_assert((if (~bvsle32(1bv32, ~bvadd32(~i~0, ~k~0)) && ~bvsle32(~bvadd32(~i~0, ~k~0), 2bv32)) && ~bvsge32(~i~0, 1bv32) then 1bv32 else 0bv32)); {226#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:38:35,579 INFO L273 TraceCheckUtils]: 12: Hoare triple {265#(and (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0)) (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32)))} assume !!~bvslt32(~i~0, 1000000bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(~j~0, ~k~0);~k~0 := ~bvsub32(~k~0, 1bv32); {261#(and (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0)) (bvsge main_~i~0 (_ bv1 32)) (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32)))} is VALID [2018-11-23 11:38:35,582 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {226#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} {269#(or (not (bvsge main_~i~0 (_ bv1 32))) (not (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32))) (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (not (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0))))} #40#return; {265#(and (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0)) (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32)))} is VALID [2018-11-23 11:38:35,583 INFO L273 TraceCheckUtils]: 10: Hoare triple {226#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} assume true; {226#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:38:35,584 INFO L273 TraceCheckUtils]: 9: Hoare triple {279#(or (= (_ bv0 32) __VERIFIER_assert_~cond) (not (= |__VERIFIER_assert_#in~cond| (_ bv0 32))))} assume !(0bv32 == ~cond); {226#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:38:35,584 INFO L273 TraceCheckUtils]: 8: Hoare triple {190#true} ~cond := #in~cond; {279#(or (= (_ bv0 32) __VERIFIER_assert_~cond) (not (= |__VERIFIER_assert_#in~cond| (_ bv0 32))))} is VALID [2018-11-23 11:38:35,584 INFO L256 TraceCheckUtils]: 7: Hoare triple {269#(or (not (bvsge main_~i~0 (_ bv1 32))) (not (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32))) (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (not (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0))))} call __VERIFIER_assert((if (~bvsle32(1bv32, ~bvadd32(~i~0, ~k~0)) && ~bvsle32(~bvadd32(~i~0, ~k~0), 2bv32)) && ~bvsge32(~i~0, 1bv32) then 1bv32 else 0bv32)); {190#true} is VALID [2018-11-23 11:38:35,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {286#(or (not (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32))) (not (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32))) (not (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0))) (bvsge (bvadd main_~i~0 (_ bv2 32)) (_ bv1 32)))} assume !!~bvslt32(~i~0, 1000000bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~j~0 := ~bvadd32(~j~0, ~k~0);~k~0 := ~bvsub32(~k~0, 1bv32); {269#(or (not (bvsge main_~i~0 (_ bv1 32))) (not (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32))) (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (not (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0))))} is VALID [2018-11-23 11:38:35,594 INFO L273 TraceCheckUtils]: 5: Hoare triple {190#true} assume !!(~bvsle32(0bv32, ~k~0) && ~bvsle32(~k~0, 1bv32)); {286#(or (not (bvsle (bvadd main_~i~0 main_~k~0) (_ bv2 32))) (not (bvsge (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32))) (not (bvsle (_ bv1 32) (bvadd main_~i~0 main_~k~0))) (bvsge (bvadd main_~i~0 (_ bv2 32)) (_ bv1 32)))} is VALID [2018-11-23 11:38:35,594 INFO L273 TraceCheckUtils]: 4: Hoare triple {190#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 1bv32;~j~0 := 1bv32;~k~0 := #t~nondet1;havoc #t~nondet1; {190#true} is VALID [2018-11-23 11:38:35,595 INFO L256 TraceCheckUtils]: 3: Hoare triple {190#true} call #t~ret2 := main(); {190#true} is VALID [2018-11-23 11:38:35,595 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #36#return; {190#true} is VALID [2018-11-23 11:38:35,595 INFO L273 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2018-11-23 11:38:35,596 INFO L256 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2018-11-23 11:38:35,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:38:35,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:38:35,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-11-23 11:38:35,603 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-11-23 11:38:35,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:38:35,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:38:35,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:35,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:38:35,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:38:35,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:38:35,771 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 16 states. [2018-11-23 11:38:37,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:37,089 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 11:38:37,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:38:37,089 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2018-11-23 11:38:37,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:38:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-11-23 11:38:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:38:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-11-23 11:38:37,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 21 transitions. [2018-11-23 11:38:37,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:37,213 INFO L225 Difference]: With dead ends: 23 [2018-11-23 11:38:37,213 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:38:37,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:38:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:38:37,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:38:37,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:37,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:38:37,216 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:38:37,216 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:38:37,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:37,216 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:38:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:38:37,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:37,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:37,217 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:38:37,217 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:38:37,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:37,218 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:38:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:38:37,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:37,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:37,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:37,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:37,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:38:37,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:38:37,219 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-11-23 11:38:37,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:37,219 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:38:37,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:38:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:38:37,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:37,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:38:37,602 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:38:37,603 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:38:37,603 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:38:37,603 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:38:37,603 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:38:37,603 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:38:37,603 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 23) the Hoare annotation is: true [2018-11-23 11:38:37,603 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 23) no Hoare annotation was computed. [2018-11-23 11:38:37,604 INFO L444 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (let ((.cse0 (bvadd main_~i~0 main_~k~0))) (and (bvsle (_ bv1 32) .cse0) (bvsge (bvadd main_~i~0 (_ bv2 32)) (_ bv1 32)) (bvsge main_~i~0 (_ bv1 32)) (bvsle .cse0 (_ bv2 32)))) [2018-11-23 11:38:37,604 INFO L444 ceAbstractionStarter]: At program point L20-1(lines 16 21) the Hoare annotation is: (let ((.cse0 (bvadd main_~i~0 main_~k~0))) (and (bvsle (_ bv1 32) .cse0) (bvsge (bvadd main_~i~0 (_ bv2 32)) (_ bv1 32)) (bvsge main_~i~0 (_ bv1 32)) (bvsle .cse0 (_ bv2 32)))) [2018-11-23 11:38:37,604 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-11-23 11:38:37,604 INFO L448 ceAbstractionStarter]: For program point L16-2(lines 16 21) no Hoare annotation was computed. [2018-11-23 11:38:37,604 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 23) no Hoare annotation was computed. [2018-11-23 11:38:37,604 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 11:38:37,605 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:38:37,605 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 11:38:37,605 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 11:38:37,605 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 11:38:37,605 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:38:37,607 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:38:37,607 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 11:38:37,607 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:38:37,607 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:38:37,607 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:38:37,607 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 11:38:37,607 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 11:38:37,608 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:38:37,608 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:38:37,608 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:38:37,608 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:38:37,608 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2018-11-23 11:38:37,608 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2018-11-23 11:38:37,701 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:38:37,701 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:38:37,701 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 11:38:37,701 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:38:37,701 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2018-11-23 11:38:37,702 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:38:37,702 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:38:37,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:38:37 BoogieIcfgContainer [2018-11-23 11:38:37,714 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:38:37,714 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:38:37,714 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:38:37,715 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:38:37,715 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:31" (3/4) ... [2018-11-23 11:38:37,719 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:38:37,726 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:38:37,726 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:38:37,727 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:38:37,731 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 11:38:37,731 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 11:38:37,731 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:38:37,785 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-lit/css2003_true-unreach-call_true-termination.c.i-witness.graphml [2018-11-23 11:38:37,786 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:38:37,787 INFO L168 Benchmark]: Toolchain (without parser) took 7682.31 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -498.0 MB). Peak memory consumption was 226.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:38:37,790 INFO L168 Benchmark]: CDTParser took 0.27 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:38:37,790 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.00 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:38:37,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.56 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:38:37,791 INFO L168 Benchmark]: Boogie Preprocessor took 30.30 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:38:37,792 INFO L168 Benchmark]: RCFGBuilder took 576.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:38:37,793 INFO L168 Benchmark]: TraceAbstraction took 6614.78 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 266.2 MB). Peak memory consumption was 266.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:38:37,793 INFO L168 Benchmark]: Witness Printer took 71.66 ms. Allocated memory is still 2.3 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:38:37,797 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.27 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 360.00 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.56 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.30 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 576.54 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6614.78 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 266.2 MB). Peak memory consumption was 266.2 MB. Max. memory is 7.1 GB. * Witness Printer took 71.66 ms. Allocated memory is still 2.3 GB. Free memory is still 1.9 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 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((~bvsle32(1bv32, ~bvadd64(i, k)) && ~bvsge32(~bvadd64(i, 2bv32), 1bv32)) && ~bvsge32(i, 1bv32)) && ~bvsle32(~bvadd64(i, k), 2bv32) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 6.4s OverallTime, 2 OverallIterations, 2 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 26 SDtfs, 17 SDslu, 116 SDs, 0 SdLazy, 91 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=1, 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, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 17 NumberOfFragments, 43 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 79 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 3600 SizeOfPredicates, 6 NumberOfNonLiveVariables, 61 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 2/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...