java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:11:28,198 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:11:28,201 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:11:28,213 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:11:28,213 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:11:28,214 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:11:28,215 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:11:28,217 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:11:28,219 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:11:28,220 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:11:28,221 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:11:28,221 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:11:28,222 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:11:28,223 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:11:28,224 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:11:28,225 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:11:28,226 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:11:28,228 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:11:28,230 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:11:28,232 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:11:28,236 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:11:28,237 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:11:28,242 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:11:28,243 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:11:28,243 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:11:28,247 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:11:28,249 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:11:28,249 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:11:28,254 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:11:28,257 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:11:28,257 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:11:28,258 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:11:28,258 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:11:28,258 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:11:28,259 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:11:28,262 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:11:28,263 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-27 06:11:28,289 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:11:28,289 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:11:28,290 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 06:11:28,290 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 06:11:28,291 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 06:11:28,291 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 06:11:28,291 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 06:11:28,291 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 06:11:28,291 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 06:11:28,292 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 06:11:28,292 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 06:11:28,292 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 06:11:28,292 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 06:11:28,292 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 06:11:28,293 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:11:28,293 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:11:28,294 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:11:28,294 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 06:11:28,294 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 06:11:28,294 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 06:11:28,294 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:11:28,295 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 06:11:28,295 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:11:28,295 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:11:28,295 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 06:11:28,295 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 06:11:28,296 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 06:11:28,296 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:11:28,296 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 06:11:28,296 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 06:11:28,296 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 06:11:28,297 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 06:11:28,297 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 06:11:28,297 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 06:11:28,297 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 06:11:28,297 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 06:11:28,361 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:11:28,382 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:11:28,386 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:11:28,388 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:11:28,389 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:11:28,390 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c [2018-10-27 06:11:28,451 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/def2314d5/6c3cb928abc146b8a33687c4f2dc0597/FLAG3ec75487e [2018-10-27 06:11:28,994 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:11:28,995 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c [2018-10-27 06:11:29,017 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/def2314d5/6c3cb928abc146b8a33687c4f2dc0597/FLAG3ec75487e [2018-10-27 06:11:29,041 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/def2314d5/6c3cb928abc146b8a33687c4f2dc0597 [2018-10-27 06:11:29,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:11:29,057 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 06:11:29,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:29,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:11:29,065 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:11:29,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:29,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78ddff4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29, skipping insertion in model container [2018-10-27 06:11:29,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:29,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:11:29,165 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:11:29,665 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:29,675 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:11:29,823 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:29,845 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:11:29,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29 WrapperNode [2018-10-27 06:11:29,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:29,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:29,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:11:29,848 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:11:29,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:29,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:30,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:30,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:11:30,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:11:30,101 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:11:30,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:30,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:30,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:30,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:30,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:30,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:30,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (1/1) ... [2018-10-27 06:11:30,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:11:30,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:11:30,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:11:30,196 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:11:30,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 06:11:30,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 06:11:30,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 06:11:30,264 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 06:11:30,264 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 06:11:30,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:11:30,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:11:30,265 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 06:11:30,265 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 06:11:33,518 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:11:33,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:33 BoogieIcfgContainer [2018-10-27 06:11:33,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:11:33,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 06:11:33,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 06:11:33,524 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 06:11:33,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 06:11:29" (1/3) ... [2018-10-27 06:11:33,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d03476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 06:11:33, skipping insertion in model container [2018-10-27 06:11:33,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:29" (2/3) ... [2018-10-27 06:11:33,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d03476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 06:11:33, skipping insertion in model container [2018-10-27 06:11:33,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:33" (3/3) ... [2018-10-27 06:11:33,528 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label05_true-unreach-call_false-termination.c [2018-10-27 06:11:33,538 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 06:11:33,547 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 06:11:33,564 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 06:11:33,604 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 06:11:33,604 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 06:11:33,604 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 06:11:33,605 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:11:33,605 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:11:33,605 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 06:11:33,605 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:11:33,605 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 06:11:33,630 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-27 06:11:33,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-27 06:11:33,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:33,648 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:33,651 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:33,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:33,658 INFO L82 PathProgramCache]: Analyzing trace with hash -782709097, now seen corresponding path program 1 times [2018-10-27 06:11:33,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:33,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:33,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:33,714 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:34,334 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 06:11:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:34,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:34,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:11:34,496 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:34,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 06:11:34,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:11:34,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:11:34,521 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-27 06:11:35,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:35,991 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-10-27 06:11:35,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:11:35,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2018-10-27 06:11:35,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:36,013 INFO L225 Difference]: With dead ends: 621 [2018-10-27 06:11:36,013 INFO L226 Difference]: Without dead ends: 382 [2018-10-27 06:11:36,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:11:36,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-27 06:11:36,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-27 06:11:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-27 06:11:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-10-27 06:11:36,110 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 133 [2018-10-27 06:11:36,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:36,115 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-10-27 06:11:36,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 06:11:36,115 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-10-27 06:11:36,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-27 06:11:36,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:36,136 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:36,137 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:36,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:36,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1001431126, now seen corresponding path program 1 times [2018-10-27 06:11:36,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:36,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:36,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:36,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:36,141 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:36,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:36,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:36,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:11:36,559 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:36,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:11:36,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:11:36,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:36,563 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-10-27 06:11:38,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:38,361 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-10-27 06:11:38,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:11:38,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2018-10-27 06:11:38,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:38,367 INFO L225 Difference]: With dead ends: 903 [2018-10-27 06:11:38,367 INFO L226 Difference]: Without dead ends: 381 [2018-10-27 06:11:38,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:38,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-27 06:11:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-27 06:11:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-27 06:11:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-10-27 06:11:38,402 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 142 [2018-10-27 06:11:38,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:38,402 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-10-27 06:11:38,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:11:38,403 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-10-27 06:11:38,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-27 06:11:38,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:38,406 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:38,407 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:38,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:38,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1638990538, now seen corresponding path program 1 times [2018-10-27 06:11:38,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:38,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:38,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:38,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:38,409 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:39,045 WARN L179 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-10-27 06:11:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:39,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:39,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:11:39,196 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:39,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:11:39,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:11:39,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:39,198 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-10-27 06:11:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:40,881 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-10-27 06:11:40,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:11:40,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2018-10-27 06:11:40,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:40,891 INFO L225 Difference]: With dead ends: 901 [2018-10-27 06:11:40,891 INFO L226 Difference]: Without dead ends: 380 [2018-10-27 06:11:40,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-27 06:11:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-27 06:11:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-27 06:11:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-10-27 06:11:40,940 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 148 [2018-10-27 06:11:40,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:40,940 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-10-27 06:11:40,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:11:40,941 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-10-27 06:11:40,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-27 06:11:40,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:40,947 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:40,947 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:40,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:40,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2027073139, now seen corresponding path program 1 times [2018-10-27 06:11:40,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:40,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:40,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:40,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:40,949 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:41,154 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:41,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:41,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 06:11:41,155 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:41,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 06:11:41,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:11:41,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:11:41,156 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-10-27 06:11:44,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:44,192 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-10-27 06:11:44,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:11:44,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2018-10-27 06:11:44,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:44,199 INFO L225 Difference]: With dead ends: 1193 [2018-10-27 06:11:44,199 INFO L226 Difference]: Without dead ends: 819 [2018-10-27 06:11:44,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:11:44,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-27 06:11:44,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-10-27 06:11:44,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-10-27 06:11:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-10-27 06:11:44,241 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 156 [2018-10-27 06:11:44,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:44,241 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-10-27 06:11:44,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 06:11:44,241 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-10-27 06:11:44,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-27 06:11:44,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:44,246 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:44,246 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:44,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:44,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1763589615, now seen corresponding path program 1 times [2018-10-27 06:11:44,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:44,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:44,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:44,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:44,248 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:44,578 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-27 06:11:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:44,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:44,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:11:44,653 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:44,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:11:44,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:11:44,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:44,654 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-10-27 06:11:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:45,763 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-10-27 06:11:45,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:11:45,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2018-10-27 06:11:45,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:45,785 INFO L225 Difference]: With dead ends: 1753 [2018-10-27 06:11:45,786 INFO L226 Difference]: Without dead ends: 804 [2018-10-27 06:11:45,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:45,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-27 06:11:45,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-10-27 06:11:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-10-27 06:11:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-10-27 06:11:45,829 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 158 [2018-10-27 06:11:45,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:45,830 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-10-27 06:11:45,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:11:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-10-27 06:11:45,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-27 06:11:45,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:45,834 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:45,834 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:45,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:45,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1311761045, now seen corresponding path program 1 times [2018-10-27 06:11:45,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:45,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:45,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:45,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:45,836 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:46,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:46,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:11:46,197 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:46,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:11:46,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:11:46,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:46,197 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-10-27 06:11:47,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:47,793 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-10-27 06:11:47,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:11:47,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2018-10-27 06:11:47,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:47,799 INFO L225 Difference]: With dead ends: 1747 [2018-10-27 06:11:47,799 INFO L226 Difference]: Without dead ends: 801 [2018-10-27 06:11:47,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:11:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-27 06:11:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-10-27 06:11:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-10-27 06:11:47,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-10-27 06:11:47,830 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 160 [2018-10-27 06:11:47,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:47,831 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-10-27 06:11:47,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:11:47,831 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-10-27 06:11:47,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-27 06:11:47,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:47,836 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:47,836 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:47,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:47,837 INFO L82 PathProgramCache]: Analyzing trace with hash -269929571, now seen corresponding path program 1 times [2018-10-27 06:11:47,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:47,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:47,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:47,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:47,839 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:48,066 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 06:11:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:48,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:48,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 06:11:48,270 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:48,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 06:11:48,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:11:48,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:11:48,272 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-10-27 06:11:49,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:49,370 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-10-27 06:11:49,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:11:49,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-10-27 06:11:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:11:49,382 INFO L225 Difference]: With dead ends: 2381 [2018-10-27 06:11:49,383 INFO L226 Difference]: Without dead ends: 1586 [2018-10-27 06:11:49,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:11:49,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-10-27 06:11:49,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-10-27 06:11:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-10-27 06:11:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-10-27 06:11:49,443 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 164 [2018-10-27 06:11:49,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:11:49,443 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-10-27 06:11:49,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 06:11:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-10-27 06:11:49,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-27 06:11:49,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:11:49,451 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:49,451 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:11:49,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:49,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1973584945, now seen corresponding path program 1 times [2018-10-27 06:11:49,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:11:49,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:49,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:49,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:49,453 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:11:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:49,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:49,647 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:11:49,647 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-10-27 06:11:49,650 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [735], [737], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 06:11:49,702 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:11:49,702 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:11:50,569 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:11:50,571 INFO L272 AbstractInterpreter]: Visited 137 different actions 268 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-27 06:11:50,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:50,614 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:11:51,196 INFO L227 lantSequenceWeakener]: Weakened 196 states. On average, predicates are now at 82.76% of their original sizes. [2018-10-27 06:11:51,197 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:11:51,767 INFO L415 sIntCurrentIteration]: We unified 198 AI predicates to 198 [2018-10-27 06:11:51,767 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:11:51,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:11:51,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-27 06:11:51,769 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:11:51,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 06:11:51,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:11:51,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:11:51,774 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 10 states. [2018-10-27 06:12:02,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:02,905 INFO L93 Difference]: Finished difference Result 3925 states and 5567 transitions. [2018-10-27 06:12:02,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 06:12:02,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 199 [2018-10-27 06:12:02,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:02,918 INFO L225 Difference]: With dead ends: 3925 [2018-10-27 06:12:02,919 INFO L226 Difference]: Without dead ends: 2373 [2018-10-27 06:12:02,925 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 208 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-10-27 06:12:02,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2018-10-27 06:12:02,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2302. [2018-10-27 06:12:02,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2302 states. [2018-10-27 06:12:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 3078 transitions. [2018-10-27 06:12:02,993 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 3078 transitions. Word has length 199 [2018-10-27 06:12:02,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:02,993 INFO L481 AbstractCegarLoop]: Abstraction has 2302 states and 3078 transitions. [2018-10-27 06:12:02,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 06:12:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 3078 transitions. [2018-10-27 06:12:03,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-27 06:12:03,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:03,005 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:03,005 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:03,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:03,006 INFO L82 PathProgramCache]: Analyzing trace with hash 929493308, now seen corresponding path program 1 times [2018-10-27 06:12:03,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:03,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:03,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:03,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:03,007 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:03,287 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:03,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:03,287 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:12:03,288 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-10-27 06:12:03,288 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [119], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [735], [737], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 06:12:03,294 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:12:03,294 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:12:03,807 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 06:12:03,808 INFO L272 AbstractInterpreter]: Visited 139 different actions 413 times. Merged at 8 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 06:12:03,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:03,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 06:12:03,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:03,847 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:12:03,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:03,861 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 06:12:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:03,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:04,269 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 06:12:04,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:12:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 06:12:04,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 06:12:04,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-10-27 06:12:04,556 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 06:12:04,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 06:12:04,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 06:12:04,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-10-27 06:12:04,561 INFO L87 Difference]: Start difference. First operand 2302 states and 3078 transitions. Second operand 14 states. [2018-10-27 06:12:09,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:09,208 INFO L93 Difference]: Finished difference Result 7739 states and 10788 transitions. [2018-10-27 06:12:09,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 06:12:09,209 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 204 [2018-10-27 06:12:09,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:09,228 INFO L225 Difference]: With dead ends: 7739 [2018-10-27 06:12:09,228 INFO L226 Difference]: Without dead ends: 3607 [2018-10-27 06:12:09,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 420 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-10-27 06:12:09,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2018-10-27 06:12:09,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3583. [2018-10-27 06:12:09,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3583 states. [2018-10-27 06:12:09,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 4207 transitions. [2018-10-27 06:12:09,332 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 4207 transitions. Word has length 204 [2018-10-27 06:12:09,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:09,332 INFO L481 AbstractCegarLoop]: Abstraction has 3583 states and 4207 transitions. [2018-10-27 06:12:09,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 06:12:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 4207 transitions. [2018-10-27 06:12:09,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-27 06:12:09,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:09,341 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:12:09,342 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:09,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:09,342 INFO L82 PathProgramCache]: Analyzing trace with hash -795997850, now seen corresponding path program 1 times [2018-10-27 06:12:09,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:09,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:09,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:09,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:09,343 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:09,765 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-10-27 06:12:10,122 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:10,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:10,122 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:12:10,123 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 221 with the following transitions: [2018-10-27 06:12:10,123 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [324], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [735], [737], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 06:12:10,128 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:12:10,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:12:10,673 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 06:12:10,674 INFO L272 AbstractInterpreter]: Visited 138 different actions 408 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 06:12:10,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:10,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 06:12:10,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:10,714 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:12:10,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:10,729 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 06:12:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:10,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 06:12:11,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:12:11,702 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 06:12:11,740 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:12:11,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-10-27 06:12:11,741 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:12:11,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 06:12:11,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:11,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:12:11,743 INFO L87 Difference]: Start difference. First operand 3583 states and 4207 transitions. Second operand 3 states. [2018-10-27 06:12:13,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:13,361 INFO L93 Difference]: Finished difference Result 6933 states and 8283 transitions. [2018-10-27 06:12:13,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:12:13,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-10-27 06:12:13,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:13,363 INFO L225 Difference]: With dead ends: 6933 [2018-10-27 06:12:13,363 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 06:12:13,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 438 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:12:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 06:12:13,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 06:12:13,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 06:12:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 06:12:13,378 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2018-10-27 06:12:13,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:13,379 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:13,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 06:12:13,379 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:12:13,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 06:12:13,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 06:12:13,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:13,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:13,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:13,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:13,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:13,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:13,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:13,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:13,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:13,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:13,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:13,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:13,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:13,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:13,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:13,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:13,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:13,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:13,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:13,890 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2018-10-27 06:12:15,049 WARN L179 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 165 DAG size of output: 81 [2018-10-27 06:12:15,344 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2018-10-27 06:12:16,503 WARN L179 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 97 DAG size of output: 54 [2018-10-27 06:12:16,506 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 06:12:16,507 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a17~0)| ~a17~0) (= |old(~a25~0)| ~a25~0) (= ~a28~0 |old(~a28~0)|)) [2018-10-27 06:12:16,507 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 06:12:16,507 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,507 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,507 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,508 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,508 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,508 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-27 06:12:16,508 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-27 06:12:16,508 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-27 06:12:16,508 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-27 06:12:16,508 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-27 06:12:16,508 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-27 06:12:16,508 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-27 06:12:16,509 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-27 06:12:16,509 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-27 06:12:16,509 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-27 06:12:16,509 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-27 06:12:16,509 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-27 06:12:16,509 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-27 06:12:16,509 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,509 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,509 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,509 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,510 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-27 06:12:16,510 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,510 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-27 06:12:16,510 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-27 06:12:16,510 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-27 06:12:16,510 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-27 06:12:16,510 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-27 06:12:16,510 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-27 06:12:16,510 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-27 06:12:16,511 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-27 06:12:16,511 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-27 06:12:16,511 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-27 06:12:16,511 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-27 06:12:16,511 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-27 06:12:16,511 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-27 06:12:16,511 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-27 06:12:16,511 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-27 06:12:16,512 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,512 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,512 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,512 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,512 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,512 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-27 06:12:16,512 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-27 06:12:16,513 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-27 06:12:16,513 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-27 06:12:16,513 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-27 06:12:16,513 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-27 06:12:16,513 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-27 06:12:16,513 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-27 06:12:16,513 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-27 06:12:16,513 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-27 06:12:16,513 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-27 06:12:16,514 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,514 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,514 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,514 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,514 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,514 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-27 06:12:16,514 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-27 06:12:16,514 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-27 06:12:16,514 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-27 06:12:16,514 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-27 06:12:16,514 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-27 06:12:16,515 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-27 06:12:16,515 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-27 06:12:16,515 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-27 06:12:16,515 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-27 06:12:16,515 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-27 06:12:16,515 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-27 06:12:16,515 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-27 06:12:16,515 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,515 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,515 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,515 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,515 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,516 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-27 06:12:16,516 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 550) no Hoare annotation was computed. [2018-10-27 06:12:16,516 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-27 06:12:16,516 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-27 06:12:16,516 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-27 06:12:16,516 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-27 06:12:16,516 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-27 06:12:16,516 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-27 06:12:16,516 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-27 06:12:16,517 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-27 06:12:16,517 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-27 06:12:16,517 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-27 06:12:16,517 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-27 06:12:16,517 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-27 06:12:16,517 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-27 06:12:16,517 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-27 06:12:16,517 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-27 06:12:16,517 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,517 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,517 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,517 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,518 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-27 06:12:16,518 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,518 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-27 06:12:16,518 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,518 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-27 06:12:16,518 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-27 06:12:16,518 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-27 06:12:16,518 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,518 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,518 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-27 06:12:16,518 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-27 06:12:16,518 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-27 06:12:16,519 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-27 06:12:16,519 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-27 06:12:16,519 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-27 06:12:16,519 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-27 06:12:16,519 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-27 06:12:16,519 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-27 06:12:16,519 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-27 06:12:16,519 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-27 06:12:16,520 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,520 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,520 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,520 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,520 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,520 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,520 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-27 06:12:16,520 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-27 06:12:16,520 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-27 06:12:16,520 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-27 06:12:16,521 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-27 06:12:16,521 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-27 06:12:16,521 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-27 06:12:16,521 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-27 06:12:16,521 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-27 06:12:16,521 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-27 06:12:16,521 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-27 06:12:16,521 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,521 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,522 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,522 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,522 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,522 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,522 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-27 06:12:16,522 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-27 06:12:16,522 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-27 06:12:16,522 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-27 06:12:16,522 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-27 06:12:16,522 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-27 06:12:16,523 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-27 06:12:16,523 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-27 06:12:16,523 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-27 06:12:16,523 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-27 06:12:16,523 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-27 06:12:16,523 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-27 06:12:16,523 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-27 06:12:16,523 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-27 06:12:16,523 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,523 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,524 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,524 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse20 (= |old(~a17~0)| ~a17~0)) (.cse18 (= |old(~a25~0)| ~a25~0)) (.cse21 (= ~a28~0 |old(~a28~0)|)) (.cse1 (= 1 |old(~a11~0)|)) (.cse19 (= 1 |old(~a19~0)|)) (.cse17 (= 1 |old(~a25~0)|))) (let ((.cse13 (= 9 |old(~a28~0)|)) (.cse16 (= 8 ~a17~0)) (.cse8 (not .cse17)) (.cse9 (not .cse19)) (.cse7 (not (= 7 |old(~a28~0)|))) (.cse15 (not (= 8 |old(~a17~0)|))) (.cse11 (= 1 ~a11~0)) (.cse12 (= 1 ~a19~0)) (.cse10 (not .cse1)) (.cse5 (< 9 |old(~a28~0)|)) (.cse3 (not (= ~a11~0 1))) (.cse14 (not (= |old(~a17~0)| 8))) (.cse0 (not (= 1 ~a21~0))) (.cse2 (= 8 |old(~a28~0)|)) (.cse4 (< 7 |old(~a17~0)|)) (.cse6 (and .cse20 .cse18 .cse21))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse5 .cse2 .cse6 .cse4) (or .cse0 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12) (not (= 7 |old(~a17~0)|))) (or .cse0 .cse5 .cse6 .cse2 .cse13 .cse14) (or .cse0 .cse8 .cse9 .cse15 (and .cse11 (= 1 ~a25~0) (= 9 ~a28~0) .cse16 .cse12) (not .cse13) .cse10) (or .cse0 .cse2 .cse6 .cse4 .cse17) (or (and .cse11 .cse16 .cse12 .cse18 (= 10 ~a28~0)) .cse0 (not (= 10 |old(~a28~0)|)) .cse8 .cse9 .cse15 .cse10) (or (and (= ~a11~0 0) (= ~a19~0 1)) .cse0 .cse9 (= 0 |old(~a28~0)|) (not (= 0 |old(~a11~0)|)) .cse15 (= |calculate_output_#in~input| 0)) (or .cse19 .cse0 .cse7 .cse15 (and .cse11 (not .cse12)) .cse10 .cse17) (or .cse0 .cse5 .cse2 .cse6 .cse14 .cse17) (or .cse0 (and .cse20 .cse18 .cse21 .cse3) .cse1 .cse14) (or .cse0 .cse1 .cse2 .cse4 .cse6)))) [2018-10-27 06:12:16,524 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,525 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,525 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,525 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-27 06:12:16,525 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-27 06:12:16,525 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-27 06:12:16,525 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-27 06:12:16,525 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-27 06:12:16,525 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-27 06:12:16,525 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-27 06:12:16,526 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-27 06:12:16,526 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-27 06:12:16,526 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-27 06:12:16,526 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-27 06:12:16,526 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-27 06:12:16,526 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-27 06:12:16,526 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,526 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,526 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,526 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,527 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,527 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,527 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-27 06:12:16,527 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-27 06:12:16,527 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-27 06:12:16,527 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-27 06:12:16,527 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-27 06:12:16,527 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-27 06:12:16,527 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-27 06:12:16,527 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-27 06:12:16,528 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-27 06:12:16,528 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-27 06:12:16,528 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-27 06:12:16,528 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-27 06:12:16,528 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-27 06:12:16,528 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-27 06:12:16,528 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-27 06:12:16,528 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-27 06:12:16,529 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,529 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,529 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,529 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,529 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:16,529 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-27 06:12:16,529 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-27 06:12:16,529 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-27 06:12:16,529 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-27 06:12:16,530 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-27 06:12:16,530 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-27 06:12:16,530 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-27 06:12:16,530 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-27 06:12:16,530 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-27 06:12:16,530 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-27 06:12:16,530 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-27 06:12:16,530 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-27 06:12:16,530 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-27 06:12:16,531 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-27 06:12:16,531 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-27 06:12:16,531 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-27 06:12:16,531 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-27 06:12:16,531 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-27 06:12:16,531 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-27 06:12:16,531 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 06:12:16,531 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-10-27 06:12:16,532 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 06:12:16,532 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 06:12:16,532 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 1 |old(~a19~0)|)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 |old(~a28~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-10-27 06:12:16,532 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-27 06:12:16,532 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse2 (<= ~a28~0 9)) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse4 (not (= ~a11~0 1))) (.cse3 (<= ~a17~0 7)) (.cse5 (not (= ~a25~0 1))) (.cse1 (not (= ~a28~0 8))) (.cse6 (= 8 ~a17~0)) (.cse7 (= 1 ~a19~0))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and .cse0 .cse1 .cse2 (not (= ~a28~0 9))) (and .cse3 .cse1 .cse2) (and .cse3 .cse1 .cse4) (and .cse5 .cse0 .cse1 .cse2) (and (= 9 ~a28~0) .cse6 .cse7) (not (= 0 |old(~a25~0)|)) (and .cse0 .cse4) (and .cse3 .cse5 .cse1) (not (= 1 |old(~a19~0)|)) (and (= 1 ~a25~0) .cse6 .cse7 (= 10 ~a28~0)) (not (= 8 |old(~a17~0)|)))) [2018-10-27 06:12:16,532 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-27 06:12:16,533 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-27 06:12:16,533 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse2 (<= ~a28~0 9)) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse4 (not (= ~a11~0 1))) (.cse3 (<= ~a17~0 7)) (.cse7 (not (= ~a25~0 1))) (.cse1 (not (= ~a28~0 8))) (.cse5 (= 8 ~a17~0)) (.cse6 (= 1 ~a19~0))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and .cse0 .cse1 .cse2 (not (= ~a28~0 9))) (and .cse3 .cse1 .cse2) (and .cse3 .cse1 .cse4) (and (= 9 ~a28~0) .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2) (not (= 0 |old(~a25~0)|)) (and .cse0 .cse4) (and .cse3 .cse7 .cse1) (not (= 1 |old(~a19~0)|)) (and (= 1 ~a25~0) .cse5 .cse6 (= 10 ~a28~0)) (not (= 8 |old(~a17~0)|)))) [2018-10-27 06:12:16,533 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-27 06:12:16,533 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-27 06:12:16,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 06:12:16 BoogieIcfgContainer [2018-10-27 06:12:16,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 06:12:16,548 INFO L168 Benchmark]: Toolchain (without parser) took 47492.73 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -662.2 MB). Peak memory consumption was 546.3 MB. Max. memory is 7.1 GB. [2018-10-27 06:12:16,549 INFO L168 Benchmark]: CDTParser took 0.29 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-10-27 06:12:16,550 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.29 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-27 06:12:16,550 INFO L168 Benchmark]: Boogie Procedure Inliner took 253.21 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -838.9 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-27 06:12:16,551 INFO L168 Benchmark]: Boogie Preprocessor took 94.98 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 06:12:16,552 INFO L168 Benchmark]: RCFGBuilder took 3323.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 107.3 MB). Peak memory consumption was 107.3 MB. Max. memory is 7.1 GB. [2018-10-27 06:12:16,553 INFO L168 Benchmark]: TraceAbstraction took 43026.84 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 457.7 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 37.7 MB). Peak memory consumption was 495.4 MB. Max. memory is 7.1 GB. [2018-10-27 06:12:16,561 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 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 788.29 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 253.21 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -838.9 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 94.98 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3323.14 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 107.3 MB). Peak memory consumption was 107.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43026.84 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 457.7 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 37.7 MB). Peak memory consumption was 495.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 550]: 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: 606]: Loop Invariant Derived loop invariant: ((((((((((((!(1 == a21) || !(7 == \old(a28))) || !(0 == \old(a11))) || (((\old(a17) == a17 && !(a28 == 8)) && a28 <= 9) && !(a28 == 9))) || ((a17 <= 7 && !(a28 == 8)) && a28 <= 9)) || ((a17 <= 7 && !(a28 == 8)) && !(a11 == 1))) || (((!(a25 == 1) && \old(a17) == a17) && !(a28 == 8)) && a28 <= 9)) || ((9 == a28 && 8 == a17) && 1 == a19)) || !(0 == \old(a25))) || (\old(a17) == a17 && !(a11 == 1))) || ((a17 <= 7 && !(a25 == 1)) && !(a28 == 8))) || !(1 == \old(a19))) || (((1 == a25 && 8 == a17) && 1 == a19) && 10 == a28)) || !(8 == \old(a17)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 42.9s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 29.3s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1206 SDtfs, 7966 SDslu, 1449 SDs, 0 SdLazy, 9461 SolverSat, 2059 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.6s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1162 GetRequests, 1070 SyntacticMatches, 10 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3583occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.1s AbstIntTime, 3 AbstIntIterations, 1 AbstIntStrong, 0.9976878706379597 AbsIntWeakeningRatio, 0.16666666666666666 AbsIntAvgWeakeningVarsNumRemoved, 26.45959595959596 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 135 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 104 PreInvPairs, 178 NumberOfFragments, 668 HoareAnnotationTreeSize, 104 FomulaSimplifications, 2770 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 3041 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 2108 NumberOfCodeBlocks, 2108 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2518 ConstructedInterpolants, 0 QuantifiedInterpolants, 2058946 SizeOfPredicates, 2 NumberOfNonLiveVariables, 990 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 791/827 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...