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-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label17_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 12:21:10,417 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 12:21:10,419 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 12:21:10,431 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 12:21:10,431 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 12:21:10,432 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 12:21:10,434 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 12:21:10,436 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 12:21:10,437 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 12:21:10,438 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 12:21:10,439 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 12:21:10,440 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 12:21:10,441 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 12:21:10,442 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 12:21:10,445 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 12:21:10,446 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 12:21:10,447 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 12:21:10,450 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 12:21:10,459 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 12:21:10,461 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 12:21:10,462 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 12:21:10,463 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 12:21:10,465 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 12:21:10,466 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 12:21:10,466 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 12:21:10,467 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 12:21:10,468 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 12:21:10,469 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 12:21:10,470 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 12:21:10,471 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 12:21:10,471 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 12:21:10,472 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 12:21:10,472 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 12:21:10,473 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 12:21:10,474 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 12:21:10,474 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 12:21:10,475 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-10-27 12:21:10,490 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 12:21:10,491 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 12:21:10,492 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 12:21:10,492 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 12:21:10,492 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 12:21:10,492 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 12:21:10,492 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 12:21:10,493 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 12:21:10,493 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 12:21:10,493 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 12:21:10,493 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 12:21:10,493 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 12:21:10,494 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 12:21:10,494 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 12:21:10,495 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 12:21:10,495 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 12:21:10,495 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 12:21:10,495 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 12:21:10,495 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 12:21:10,495 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 12:21:10,496 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 12:21:10,496 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 12:21:10,496 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 12:21:10,496 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 12:21:10,496 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 12:21:10,497 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 12:21:10,497 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 12:21:10,497 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 12:21:10,497 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 12:21:10,497 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 12:21:10,498 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 12:21:10,498 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 12:21:10,498 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 12:21:10,498 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 12:21:10,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 12:21:10,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 12:21:10,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 12:21:10,573 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 12:21:10,574 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 12:21:10,575 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label17_true-unreach-call_false-termination.c [2018-10-27 12:21:10,635 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1a370b84d/62bf3222d00d41d39b02dca485c57313/FLAGac2d9670b [2018-10-27 12:21:11,207 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 12:21:11,209 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label17_true-unreach-call_false-termination.c [2018-10-27 12:21:11,238 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1a370b84d/62bf3222d00d41d39b02dca485c57313/FLAGac2d9670b [2018-10-27 12:21:11,258 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1a370b84d/62bf3222d00d41d39b02dca485c57313 [2018-10-27 12:21:11,272 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 12:21:11,275 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 12:21:11,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 12:21:11,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 12:21:11,284 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 12:21:11,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:21:11" (1/1) ... [2018-10-27 12:21:11,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@401f344f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:11, skipping insertion in model container [2018-10-27 12:21:11,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:21:11" (1/1) ... [2018-10-27 12:21:11,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 12:21:11,377 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 12:21:11,879 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:21:11,883 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 12:21:12,010 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 12:21:12,029 INFO L193 MainTranslator]: Completed translation [2018-10-27 12:21:12,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:12 WrapperNode [2018-10-27 12:21:12,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 12:21:12,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 12:21:12,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 12:21:12,031 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 12:21:12,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:12" (1/1) ... [2018-10-27 12:21:12,072 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:12" (1/1) ... [2018-10-27 12:21:12,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 12:21:12,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 12:21:12,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 12:21:12,238 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 12:21:12,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:12" (1/1) ... [2018-10-27 12:21:12,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:12" (1/1) ... [2018-10-27 12:21:12,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:12" (1/1) ... [2018-10-27 12:21:12,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:12" (1/1) ... [2018-10-27 12:21:12,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:12" (1/1) ... [2018-10-27 12:21:12,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:12" (1/1) ... [2018-10-27 12:21:12,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:12" (1/1) ... [2018-10-27 12:21:12,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 12:21:12,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 12:21:12,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 12:21:12,355 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 12:21:12,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:12" (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 12:21:12,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 12:21:12,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 12:21:12,416 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 12:21:12,417 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 12:21:12,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 12:21:12,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 12:21:12,417 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 12:21:12,417 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 12:21:15,640 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 12:21:15,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:21:15 BoogieIcfgContainer [2018-10-27 12:21:15,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 12:21:15,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 12:21:15,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 12:21:15,651 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 12:21:15,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:21:11" (1/3) ... [2018-10-27 12:21:15,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33622fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:21:15, skipping insertion in model container [2018-10-27 12:21:15,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:21:12" (2/3) ... [2018-10-27 12:21:15,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33622fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:21:15, skipping insertion in model container [2018-10-27 12:21:15,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:21:15" (3/3) ... [2018-10-27 12:21:15,659 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label17_true-unreach-call_false-termination.c [2018-10-27 12:21:15,671 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 12:21:15,683 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 12:21:15,702 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 12:21:15,740 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 12:21:15,741 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 12:21:15,741 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 12:21:15,741 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 12:21:15,741 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 12:21:15,742 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 12:21:15,742 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 12:21:15,742 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 12:21:15,785 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-27 12:21:15,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-27 12:21:15,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:21:15,801 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] [2018-10-27 12:21:15,805 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:21:15,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:15,811 INFO L82 PathProgramCache]: Analyzing trace with hash -346865840, now seen corresponding path program 1 times [2018-10-27 12:21:15,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:21:15,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:15,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:21:15,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:15,873 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:21:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:21:16,488 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:21:16,656 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 12:21:16,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:21:16,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 12:21:16,660 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:21:16,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:21:16,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:21:16,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 12:21:16,685 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-27 12:21:18,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:21:18,316 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-10-27 12:21:18,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:21:18,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2018-10-27 12:21:18,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:21:18,343 INFO L225 Difference]: With dead ends: 618 [2018-10-27 12:21:18,344 INFO L226 Difference]: Without dead ends: 379 [2018-10-27 12:21:18,351 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 12:21:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-27 12:21:18,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-10-27 12:21:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-27 12:21:18,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-10-27 12:21:18,471 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 126 [2018-10-27 12:21:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:21:18,473 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-10-27 12:21:18,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:21:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-10-27 12:21:18,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-27 12:21:18,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:21:18,491 INFO L375 BasicCegarLoop]: trace histogram [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 12:21:18,493 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:21:18,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:18,493 INFO L82 PathProgramCache]: Analyzing trace with hash -837125915, now seen corresponding path program 1 times [2018-10-27 12:21:18,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:21:18,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:18,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:21:18,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:18,500 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:21:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:21:18,735 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-10-27 12:21:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:21:18,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:21:18,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 12:21:18,795 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:21:18,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 12:21:18,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 12:21:18,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 12:21:18,798 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-10-27 12:21:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:21:20,794 INFO L93 Difference]: Finished difference Result 1229 states and 2094 transitions. [2018-10-27 12:21:20,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 12:21:20,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2018-10-27 12:21:20,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:21:20,816 INFO L225 Difference]: With dead ends: 1229 [2018-10-27 12:21:20,817 INFO L226 Difference]: Without dead ends: 856 [2018-10-27 12:21:20,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 12:21:20,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-10-27 12:21:20,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 823. [2018-10-27 12:21:20,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2018-10-27 12:21:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1292 transitions. [2018-10-27 12:21:20,897 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1292 transitions. Word has length 142 [2018-10-27 12:21:20,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:21:20,897 INFO L481 AbstractCegarLoop]: Abstraction has 823 states and 1292 transitions. [2018-10-27 12:21:20,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 12:21:20,898 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1292 transitions. [2018-10-27 12:21:20,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-27 12:21:20,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:21:20,904 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] [2018-10-27 12:21:20,905 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:21:20,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:20,905 INFO L82 PathProgramCache]: Analyzing trace with hash -517700326, now seen corresponding path program 1 times [2018-10-27 12:21:20,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:21:20,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:20,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:21:20,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:20,907 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:21:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:21:21,166 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 12:21:21,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 12:21:21,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 12:21:21,167 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:21:21,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 12:21:21,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 12:21:21,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 12:21:21,169 INFO L87 Difference]: Start difference. First operand 823 states and 1292 transitions. Second operand 6 states. [2018-10-27 12:21:25,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:21:25,464 INFO L93 Difference]: Finished difference Result 2557 states and 4222 transitions. [2018-10-27 12:21:25,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 12:21:25,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2018-10-27 12:21:25,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:21:25,484 INFO L225 Difference]: With dead ends: 2557 [2018-10-27 12:21:25,484 INFO L226 Difference]: Without dead ends: 1740 [2018-10-27 12:21:25,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 12:21:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2018-10-27 12:21:25,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1682. [2018-10-27 12:21:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2018-10-27 12:21:25,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2540 transitions. [2018-10-27 12:21:25,565 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2540 transitions. Word has length 149 [2018-10-27 12:21:25,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:21:25,565 INFO L481 AbstractCegarLoop]: Abstraction has 1682 states and 2540 transitions. [2018-10-27 12:21:25,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 12:21:25,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2540 transitions. [2018-10-27 12:21:25,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-27 12:21:25,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:21:25,576 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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 12:21:25,576 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:21:25,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:25,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1972736718, now seen corresponding path program 1 times [2018-10-27 12:21:25,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:21:25,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:25,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:21:25,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:25,578 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:21:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:21:25,793 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:21:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 12:21:26,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:21:26,084 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:21:26,085 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-10-27 12:21:26,087 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [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], [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], [679], [681], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:21:26,138 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:21:26,139 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:21:26,813 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:21:26,815 INFO L272 AbstractInterpreter]: Visited 127 different actions 127 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-10-27 12:21:26,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:26,858 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:21:27,394 INFO L227 lantSequenceWeakener]: Weakened 129 states. On average, predicates are now at 81.38% of their original sizes. [2018-10-27 12:21:27,395 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:21:28,972 INFO L415 sIntCurrentIteration]: We unified 150 AI predicates to 150 [2018-10-27 12:21:28,972 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:21:28,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:21:28,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-10-27 12:21:28,973 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:21:28,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 12:21:28,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 12:21:28,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-10-27 12:21:28,975 INFO L87 Difference]: Start difference. First operand 1682 states and 2540 transitions. Second operand 14 states. [2018-10-27 12:21:44,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:21:44,067 INFO L93 Difference]: Finished difference Result 3656 states and 5500 transitions. [2018-10-27 12:21:44,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-27 12:21:44,067 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 151 [2018-10-27 12:21:44,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:21:44,078 INFO L225 Difference]: With dead ends: 3656 [2018-10-27 12:21:44,078 INFO L226 Difference]: Without dead ends: 1980 [2018-10-27 12:21:44,085 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 163 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2018-10-27 12:21:44,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2018-10-27 12:21:44,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1827. [2018-10-27 12:21:44,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1827 states. [2018-10-27 12:21:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2692 transitions. [2018-10-27 12:21:44,136 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2692 transitions. Word has length 151 [2018-10-27 12:21:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:21:44,137 INFO L481 AbstractCegarLoop]: Abstraction has 1827 states and 2692 transitions. [2018-10-27 12:21:44,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 12:21:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2692 transitions. [2018-10-27 12:21:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-27 12:21:44,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:21:44,145 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-10-27 12:21:44,145 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:21:44,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:44,146 INFO L82 PathProgramCache]: Analyzing trace with hash -336940495, now seen corresponding path program 1 times [2018-10-27 12:21:44,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:21:44,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:44,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:21:44,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:44,147 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:21:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:21:44,451 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-27 12:21:44,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:21:44,452 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:21:44,452 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 162 with the following transitions: [2018-10-27 12:21:44,452 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [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], [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], [679], [681], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:21:44,458 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:21:44,458 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:21:45,096 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:21:45,096 INFO L272 AbstractInterpreter]: Visited 131 different actions 392 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-27 12:21:45,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:45,104 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:21:45,361 INFO L227 lantSequenceWeakener]: Weakened 158 states. On average, predicates are now at 81.08% of their original sizes. [2018-10-27 12:21:45,361 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:21:45,721 INFO L415 sIntCurrentIteration]: We unified 160 AI predicates to 160 [2018-10-27 12:21:45,721 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:21:45,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:21:45,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2018-10-27 12:21:45,722 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:21:45,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 12:21:45,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 12:21:45,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-27 12:21:45,723 INFO L87 Difference]: Start difference. First operand 1827 states and 2692 transitions. Second operand 10 states. [2018-10-27 12:21:53,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:21:53,916 INFO L93 Difference]: Finished difference Result 4463 states and 6600 transitions. [2018-10-27 12:21:53,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 12:21:53,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 161 [2018-10-27 12:21:53,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:21:53,930 INFO L225 Difference]: With dead ends: 4463 [2018-10-27 12:21:53,930 INFO L226 Difference]: Without dead ends: 2642 [2018-10-27 12:21:53,937 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 169 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-10-27 12:21:53,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2018-10-27 12:21:53,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 2556. [2018-10-27 12:21:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2556 states. [2018-10-27 12:21:54,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 3571 transitions. [2018-10-27 12:21:54,006 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 3571 transitions. Word has length 161 [2018-10-27 12:21:54,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:21:54,008 INFO L481 AbstractCegarLoop]: Abstraction has 2556 states and 3571 transitions. [2018-10-27 12:21:54,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 12:21:54,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 3571 transitions. [2018-10-27 12:21:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-27 12:21:54,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:21:54,018 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:21:54,019 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:21:54,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:54,019 INFO L82 PathProgramCache]: Analyzing trace with hash 260628057, now seen corresponding path program 1 times [2018-10-27 12:21:54,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:21:54,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:54,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:21:54,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:21:54,020 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:21:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:21:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:21:54,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:21:54,481 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:21:54,481 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2018-10-27 12:21:54,482 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], [91], [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], [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], [679], [681], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:21:54,486 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:21:54,486 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:21:54,851 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:21:54,852 INFO L272 AbstractInterpreter]: Visited 130 different actions 256 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-27 12:21:54,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:21:54,890 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:21:55,258 INFO L227 lantSequenceWeakener]: Weakened 78 states. On average, predicates are now at 81.4% of their original sizes. [2018-10-27 12:21:55,258 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:21:56,140 INFO L415 sIntCurrentIteration]: We unified 166 AI predicates to 166 [2018-10-27 12:21:56,140 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:21:56,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:21:56,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-10-27 12:21:56,141 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:21:56,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 12:21:56,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 12:21:56,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-10-27 12:21:56,143 INFO L87 Difference]: Start difference. First operand 2556 states and 3571 transitions. Second operand 18 states. [2018-10-27 12:22:08,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:22:08,808 INFO L93 Difference]: Finished difference Result 5863 states and 8199 transitions. [2018-10-27 12:22:08,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-27 12:22:08,809 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 167 [2018-10-27 12:22:08,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:22:08,824 INFO L225 Difference]: With dead ends: 5863 [2018-10-27 12:22:08,824 INFO L226 Difference]: Without dead ends: 3313 [2018-10-27 12:22:08,834 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 181 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-10-27 12:22:08,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3313 states. [2018-10-27 12:22:09,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3313 to 3301. [2018-10-27 12:22:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3301 states. [2018-10-27 12:22:09,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3301 states to 3301 states and 4468 transitions. [2018-10-27 12:22:09,243 INFO L78 Accepts]: Start accepts. Automaton has 3301 states and 4468 transitions. Word has length 167 [2018-10-27 12:22:09,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:22:09,244 INFO L481 AbstractCegarLoop]: Abstraction has 3301 states and 4468 transitions. [2018-10-27 12:22:09,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 12:22:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 3301 states and 4468 transitions. [2018-10-27 12:22:09,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-27 12:22:09,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:22:09,255 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-10-27 12:22:09,256 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:22:09,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:09,256 INFO L82 PathProgramCache]: Analyzing trace with hash 197096077, now seen corresponding path program 1 times [2018-10-27 12:22:09,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:22:09,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:09,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:09,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:09,257 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:22:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 59 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 12:22:09,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:09,466 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:22:09,466 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2018-10-27 12:22:09,466 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [91], [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], [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], [679], [681], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:22:09,470 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:22:09,470 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:22:10,092 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:22:10,092 INFO L272 AbstractInterpreter]: Visited 132 different actions 529 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 12:22:10,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:10,128 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:22:10,452 INFO L227 lantSequenceWeakener]: Weakened 183 states. On average, predicates are now at 81.07% of their original sizes. [2018-10-27 12:22:10,453 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:22:10,934 INFO L415 sIntCurrentIteration]: We unified 185 AI predicates to 185 [2018-10-27 12:22:10,935 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:22:10,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:22:10,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2018-10-27 12:22:10,935 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:22:10,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 12:22:10,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 12:22:10,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-27 12:22:10,936 INFO L87 Difference]: Start difference. First operand 3301 states and 4468 transitions. Second operand 10 states. [2018-10-27 12:22:15,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:22:15,898 INFO L93 Difference]: Finished difference Result 7443 states and 10184 transitions. [2018-10-27 12:22:15,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 12:22:15,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 186 [2018-10-27 12:22:15,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:22:15,918 INFO L225 Difference]: With dead ends: 7443 [2018-10-27 12:22:15,918 INFO L226 Difference]: Without dead ends: 4148 [2018-10-27 12:22:15,930 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 194 GetRequests, 138 SyntacticMatches, 39 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-10-27 12:22:15,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4148 states. [2018-10-27 12:22:16,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4148 to 4067. [2018-10-27 12:22:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4067 states. [2018-10-27 12:22:16,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4067 states to 4067 states and 5417 transitions. [2018-10-27 12:22:16,060 INFO L78 Accepts]: Start accepts. Automaton has 4067 states and 5417 transitions. Word has length 186 [2018-10-27 12:22:16,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:22:16,060 INFO L481 AbstractCegarLoop]: Abstraction has 4067 states and 5417 transitions. [2018-10-27 12:22:16,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 12:22:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 4067 states and 5417 transitions. [2018-10-27 12:22:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-27 12:22:16,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:22:16,075 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:22:16,075 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:22:16,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:16,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1639328400, now seen corresponding path program 1 times [2018-10-27 12:22:16,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:22:16,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:16,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:16,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:16,077 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:22:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 64 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-27 12:22:16,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:16,432 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:22:16,432 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2018-10-27 12:22:16,433 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [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], [127], [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], [679], [681], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:22:16,435 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:22:16,435 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:22:17,478 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:22:17,479 INFO L272 AbstractInterpreter]: Visited 131 different actions 655 times. Merged at 8 different actions 44 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 12:22:17,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:17,491 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:22:17,722 INFO L227 lantSequenceWeakener]: Weakened 183 states. On average, predicates are now at 81.03% of their original sizes. [2018-10-27 12:22:17,722 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:22:17,836 INFO L415 sIntCurrentIteration]: We unified 185 AI predicates to 185 [2018-10-27 12:22:17,836 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:22:17,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:22:17,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-10-27 12:22:17,837 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:22:17,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 12:22:17,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 12:22:17,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-10-27 12:22:17,838 INFO L87 Difference]: Start difference. First operand 4067 states and 5417 transitions. Second operand 11 states. [2018-10-27 12:22:27,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:22:27,210 INFO L93 Difference]: Finished difference Result 9610 states and 13154 transitions. [2018-10-27 12:22:27,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 12:22:27,211 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 186 [2018-10-27 12:22:27,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:22:27,232 INFO L225 Difference]: With dead ends: 9610 [2018-10-27 12:22:27,232 INFO L226 Difference]: Without dead ends: 5549 [2018-10-27 12:22:27,244 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 197 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2018-10-27 12:22:27,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5549 states. [2018-10-27 12:22:27,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5549 to 5448. [2018-10-27 12:22:27,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5448 states. [2018-10-27 12:22:27,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5448 states to 5448 states and 7157 transitions. [2018-10-27 12:22:27,392 INFO L78 Accepts]: Start accepts. Automaton has 5448 states and 7157 transitions. Word has length 186 [2018-10-27 12:22:27,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:22:27,393 INFO L481 AbstractCegarLoop]: Abstraction has 5448 states and 7157 transitions. [2018-10-27 12:22:27,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 12:22:27,393 INFO L276 IsEmpty]: Start isEmpty. Operand 5448 states and 7157 transitions. [2018-10-27 12:22:27,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-27 12:22:27,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:22:27,408 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:22:27,408 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:22:27,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:27,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1746497625, now seen corresponding path program 1 times [2018-10-27 12:22:27,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:22:27,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:27,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:27,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:27,410 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:22:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:27,773 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 12:22:27,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:27,774 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:22:27,774 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 195 with the following transitions: [2018-10-27 12:22:27,774 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], [107], [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], [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], [679], [681], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:22:27,776 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:22:27,777 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:22:28,446 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:22:28,446 INFO L272 AbstractInterpreter]: Visited 132 different actions 527 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 4 different actions. Largest state had 38 variables. [2018-10-27 12:22:28,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:28,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:22:28,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:28,456 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 12:22:28,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:28,472 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:22:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:28,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:22:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 12:22:28,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:22:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 12:22:28,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:22:28,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-10-27 12:22:28,998 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:22:28,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 12:22:28,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 12:22:28,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-27 12:22:28,999 INFO L87 Difference]: Start difference. First operand 5448 states and 7157 transitions. Second operand 9 states. [2018-10-27 12:22:34,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:22:34,046 INFO L93 Difference]: Finished difference Result 13039 states and 17687 transitions. [2018-10-27 12:22:34,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 12:22:34,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 194 [2018-10-27 12:22:34,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:22:34,067 INFO L225 Difference]: With dead ends: 13039 [2018-10-27 12:22:34,067 INFO L226 Difference]: Without dead ends: 4547 [2018-10-27 12:22:34,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 396 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2018-10-27 12:22:34,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4547 states. [2018-10-27 12:22:34,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4547 to 4329. [2018-10-27 12:22:34,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4329 states. [2018-10-27 12:22:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4329 states to 4329 states and 5204 transitions. [2018-10-27 12:22:34,232 INFO L78 Accepts]: Start accepts. Automaton has 4329 states and 5204 transitions. Word has length 194 [2018-10-27 12:22:34,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:22:34,233 INFO L481 AbstractCegarLoop]: Abstraction has 4329 states and 5204 transitions. [2018-10-27 12:22:34,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 12:22:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand 4329 states and 5204 transitions. [2018-10-27 12:22:34,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-27 12:22:34,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:22:34,242 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-27 12:22:34,242 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:22:34,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:34,242 INFO L82 PathProgramCache]: Analyzing trace with hash 248413529, now seen corresponding path program 1 times [2018-10-27 12:22:34,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:22:34,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:34,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:34,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:34,244 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:22:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 12:22:35,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:35,187 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:22:35,188 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 210 with the following transitions: [2018-10-27 12:22:35,188 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [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], [679], [681], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:22:35,190 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:22:35,190 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:22:35,873 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 12:22:35,873 INFO L272 AbstractInterpreter]: Visited 130 different actions 388 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 12:22:35,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:35,879 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 12:22:36,254 INFO L227 lantSequenceWeakener]: Weakened 206 states. On average, predicates are now at 80.95% of their original sizes. [2018-10-27 12:22:36,256 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 12:22:36,587 INFO L415 sIntCurrentIteration]: We unified 208 AI predicates to 208 [2018-10-27 12:22:36,588 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 12:22:36,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:22:36,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2018-10-27 12:22:36,588 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:22:36,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 12:22:36,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 12:22:36,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-10-27 12:22:36,590 INFO L87 Difference]: Start difference. First operand 4329 states and 5204 transitions. Second operand 11 states. [2018-10-27 12:22:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:22:43,599 INFO L93 Difference]: Finished difference Result 12155 states and 15028 transitions. [2018-10-27 12:22:43,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-27 12:22:43,599 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 209 [2018-10-27 12:22:43,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:22:43,618 INFO L225 Difference]: With dead ends: 12155 [2018-10-27 12:22:43,619 INFO L226 Difference]: Without dead ends: 7071 [2018-10-27 12:22:43,629 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 220 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2018-10-27 12:22:43,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7071 states. [2018-10-27 12:22:43,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7071 to 5583. [2018-10-27 12:22:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5583 states. [2018-10-27 12:22:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5583 states to 5583 states and 6738 transitions. [2018-10-27 12:22:43,766 INFO L78 Accepts]: Start accepts. Automaton has 5583 states and 6738 transitions. Word has length 209 [2018-10-27 12:22:43,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:22:43,766 INFO L481 AbstractCegarLoop]: Abstraction has 5583 states and 6738 transitions. [2018-10-27 12:22:43,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 12:22:43,767 INFO L276 IsEmpty]: Start isEmpty. Operand 5583 states and 6738 transitions. [2018-10-27 12:22:43,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-27 12:22:43,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:22:43,778 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-10-27 12:22:43,779 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:22:43,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:43,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1625091819, now seen corresponding path program 1 times [2018-10-27 12:22:43,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:22:43,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:43,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:43,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:43,780 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:22:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:44,184 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 127 proven. 62 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-27 12:22:44,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:44,185 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:22:44,185 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 244 with the following transitions: [2018-10-27 12:22:44,185 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], [107], [108], [112], [116], [120], [123], [124], [128], [131], [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], [679], [681], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:22:44,187 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:22:44,188 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:22:45,309 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:22:45,309 INFO L272 AbstractInterpreter]: Visited 133 different actions 931 times. Merged at 9 different actions 69 times. Widened at 1 different actions 4 times. Found 19 fixpoints after 5 different actions. Largest state had 38 variables. [2018-10-27 12:22:45,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:45,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:22:45,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:45,311 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 12:22:45,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:45,321 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:22:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:45,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:22:45,509 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 147 proven. 2 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-27 12:22:45,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:22:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 127 proven. 62 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-27 12:22:45,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:22:45,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-27 12:22:45,683 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:22:45,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 12:22:45,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 12:22:45,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-27 12:22:45,684 INFO L87 Difference]: Start difference. First operand 5583 states and 6738 transitions. Second operand 9 states. [2018-10-27 12:22:49,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:22:49,122 INFO L93 Difference]: Finished difference Result 14201 states and 17384 transitions. [2018-10-27 12:22:49,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-27 12:22:49,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 243 [2018-10-27 12:22:49,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:22:49,147 INFO L225 Difference]: With dead ends: 14201 [2018-10-27 12:22:49,147 INFO L226 Difference]: Without dead ends: 8467 [2018-10-27 12:22:49,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 507 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=308, Invalid=1024, Unknown=0, NotChecked=0, Total=1332 [2018-10-27 12:22:49,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8467 states. [2018-10-27 12:22:49,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8467 to 8249. [2018-10-27 12:22:49,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8249 states. [2018-10-27 12:22:49,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8249 states to 8249 states and 9390 transitions. [2018-10-27 12:22:49,353 INFO L78 Accepts]: Start accepts. Automaton has 8249 states and 9390 transitions. Word has length 243 [2018-10-27 12:22:49,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:22:49,354 INFO L481 AbstractCegarLoop]: Abstraction has 8249 states and 9390 transitions. [2018-10-27 12:22:49,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 12:22:49,354 INFO L276 IsEmpty]: Start isEmpty. Operand 8249 states and 9390 transitions. [2018-10-27 12:22:49,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-27 12:22:49,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:22:49,370 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-10-27 12:22:49,370 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:22:49,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:49,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1671852504, now seen corresponding path program 1 times [2018-10-27 12:22:49,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:22:49,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:49,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:49,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:49,372 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:22:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:49,616 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 12:22:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 183 proven. 83 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-10-27 12:22:49,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:49,710 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:22:49,710 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 268 with the following transitions: [2018-10-27 12:22:49,710 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [21], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [174], [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], [679], [681], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:22:49,713 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:22:49,713 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:22:51,300 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:22:51,300 INFO L272 AbstractInterpreter]: Visited 134 different actions 1222 times. Merged at 10 different actions 109 times. Widened at 1 different actions 5 times. Found 31 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 12:22:51,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:51,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:22:51,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:51,310 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 12:22:51,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:51,320 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:22:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:51,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:22:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 253 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-27 12:22:51,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:22:51,656 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 198 proven. 40 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-10-27 12:22:51,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 12:22:51,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-10-27 12:22:51,678 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 12:22:51,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 12:22:51,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 12:22:51,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-10-27 12:22:51,679 INFO L87 Difference]: Start difference. First operand 8249 states and 9390 transitions. Second operand 14 states. [2018-10-27 12:22:55,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:22:55,498 INFO L93 Difference]: Finished difference Result 14147 states and 16619 transitions. [2018-10-27 12:22:55,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-27 12:22:55,499 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 267 [2018-10-27 12:22:55,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:22:55,510 INFO L225 Difference]: With dead ends: 14147 [2018-10-27 12:22:55,511 INFO L226 Difference]: Without dead ends: 4534 [2018-10-27 12:22:55,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 550 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=540, Invalid=1530, Unknown=0, NotChecked=0, Total=2070 [2018-10-27 12:22:55,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2018-10-27 12:22:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 3921. [2018-10-27 12:22:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3921 states. [2018-10-27 12:22:55,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3921 states to 3921 states and 4516 transitions. [2018-10-27 12:22:55,626 INFO L78 Accepts]: Start accepts. Automaton has 3921 states and 4516 transitions. Word has length 267 [2018-10-27 12:22:55,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:22:55,626 INFO L481 AbstractCegarLoop]: Abstraction has 3921 states and 4516 transitions. [2018-10-27 12:22:55,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 12:22:55,626 INFO L276 IsEmpty]: Start isEmpty. Operand 3921 states and 4516 transitions. [2018-10-27 12:22:55,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-10-27 12:22:55,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 12:22:55,641 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-27 12:22:55,641 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 12:22:55,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:55,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1348141195, now seen corresponding path program 1 times [2018-10-27 12:22:55,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 12:22:55,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:55,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:55,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 12:22:55,643 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 12:22:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 374 proven. 30 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2018-10-27 12:22:56,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:56,235 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 12:22:56,236 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 358 with the following transitions: [2018-10-27 12:22:56,236 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], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [159], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [248], [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], [679], [681], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 12:22:56,239 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 12:22:56,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 12:22:59,628 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 12:22:59,629 INFO L272 AbstractInterpreter]: Visited 134 different actions 3024 times. Merged at 10 different actions 311 times. Widened at 1 different actions 19 times. Found 82 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 12:22:59,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 12:22:59,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 12:22:59,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 12:22:59,636 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 12:22:59,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 12:22:59,651 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 12:22:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 12:22:59,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 12:22:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2018-10-27 12:22:59,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 12:23:00,093 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2018-10-27 12:23:00,114 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 12:23:00,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2018-10-27 12:23:00,114 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 12:23:00,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 12:23:00,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 12:23:00,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-27 12:23:00,116 INFO L87 Difference]: Start difference. First operand 3921 states and 4516 transitions. Second operand 3 states. [2018-10-27 12:23:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 12:23:00,654 INFO L93 Difference]: Finished difference Result 6648 states and 7690 transitions. [2018-10-27 12:23:00,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 12:23:00,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 357 [2018-10-27 12:23:00,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 12:23:00,656 INFO L225 Difference]: With dead ends: 6648 [2018-10-27 12:23:00,656 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 12:23:00,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 713 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-27 12:23:00,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 12:23:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 12:23:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 12:23:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 12:23:00,671 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 357 [2018-10-27 12:23:00,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 12:23:00,672 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 12:23:00,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 12:23:00,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 12:23:00,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 12:23:00,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 12:23:00,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:01,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:01,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:01,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:01,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:01,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:01,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:01,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,157 WARN L179 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 311 DAG size of output: 239 [2018-10-27 12:23:02,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 12:23:02,919 WARN L179 SmtUtils]: Spent 760.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 284 [2018-10-27 12:23:03,587 WARN L179 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2018-10-27 12:23:03,885 WARN L179 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 77 [2018-10-27 12:23:09,312 WARN L179 SmtUtils]: Spent 5.40 s on a formula simplification. DAG size of input: 398 DAG size of output: 146 [2018-10-27 12:23:10,988 WARN L179 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 262 DAG size of output: 127 [2018-10-27 12:23:13,182 WARN L179 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 309 DAG size of output: 129 [2018-10-27 12:23:13,185 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 12:23:13,186 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a19~0)| ~a19~0) (= ~a11~0 |old(~a11~0)|) (= |old(~a17~0)| ~a17~0) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-10-27 12:23:13,186 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 12:23:13,186 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,186 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,186 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,186 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,187 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,187 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-27 12:23:13,187 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-27 12:23:13,187 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-27 12:23:13,187 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-27 12:23:13,187 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-27 12:23:13,187 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-27 12:23:13,187 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-27 12:23:13,187 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-27 12:23:13,188 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-27 12:23:13,188 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-27 12:23:13,188 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-27 12:23:13,188 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-27 12:23:13,188 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-27 12:23:13,188 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,188 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,188 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,188 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,188 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-27 12:23:13,189 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,189 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-27 12:23:13,189 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-27 12:23:13,189 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-27 12:23:13,189 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-27 12:23:13,189 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-27 12:23:13,189 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-27 12:23:13,189 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-27 12:23:13,189 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-27 12:23:13,189 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-27 12:23:13,189 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-27 12:23:13,189 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-27 12:23:13,189 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-27 12:23:13,190 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-27 12:23:13,190 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-27 12:23:13,190 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-27 12:23:13,190 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,190 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,190 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,190 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,190 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,191 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-27 12:23:13,191 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-27 12:23:13,191 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-27 12:23:13,191 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-27 12:23:13,191 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-27 12:23:13,191 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-27 12:23:13,191 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-27 12:23:13,191 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-27 12:23:13,191 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-27 12:23:13,192 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 529) no Hoare annotation was computed. [2018-10-27 12:23:13,192 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-27 12:23:13,192 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-27 12:23:13,192 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,192 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,192 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,192 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,192 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,193 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-27 12:23:13,193 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-27 12:23:13,193 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-27 12:23:13,193 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-27 12:23:13,193 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-27 12:23:13,193 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-27 12:23:13,193 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-27 12:23:13,193 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-27 12:23:13,193 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-27 12:23:13,193 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-27 12:23:13,194 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-27 12:23:13,194 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-27 12:23:13,194 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-27 12:23:13,194 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,194 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,194 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,194 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,194 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,194 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-27 12:23:13,194 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-27 12:23:13,195 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-27 12:23:13,195 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-27 12:23:13,195 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-27 12:23:13,195 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-27 12:23:13,195 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-27 12:23:13,195 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-27 12:23:13,195 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-27 12:23:13,195 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-27 12:23:13,195 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-27 12:23:13,195 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-27 12:23:13,196 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-27 12:23:13,196 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-27 12:23:13,196 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-27 12:23:13,196 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-27 12:23:13,196 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,196 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,196 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,196 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,196 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-27 12:23:13,196 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,196 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-27 12:23:13,197 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,197 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-27 12:23:13,197 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-27 12:23:13,197 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-27 12:23:13,197 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,197 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,197 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-27 12:23:13,197 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-27 12:23:13,197 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-27 12:23:13,198 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-27 12:23:13,198 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-27 12:23:13,198 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-27 12:23:13,198 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-27 12:23:13,198 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-27 12:23:13,198 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-27 12:23:13,198 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-27 12:23:13,198 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-27 12:23:13,198 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,198 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,199 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,199 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,199 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,199 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,199 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-27 12:23:13,199 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-27 12:23:13,199 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-27 12:23:13,199 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-27 12:23:13,199 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-27 12:23:13,199 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-27 12:23:13,199 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-27 12:23:13,200 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-27 12:23:13,200 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-27 12:23:13,200 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-27 12:23:13,200 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-27 12:23:13,200 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,200 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,200 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,200 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,200 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,200 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,200 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-27 12:23:13,200 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-27 12:23:13,201 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-27 12:23:13,201 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-27 12:23:13,201 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-27 12:23:13,201 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-27 12:23:13,201 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-27 12:23:13,201 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-27 12:23:13,201 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-27 12:23:13,201 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-27 12:23:13,201 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-27 12:23:13,201 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-27 12:23:13,201 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-27 12:23:13,202 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-27 12:23:13,202 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,202 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,202 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,203 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse24 (= 1 |old(~a11~0)|)) (.cse34 (= 1 |old(~a25~0)|)) (.cse40 (= 1 ~a11~0)) (.cse9 (<= ~a28~0 10)) (.cse0 (< 1 |old(~a19~0)|)) (.cse38 (not (= 8 |old(~a17~0)|))) (.cse43 (< 1 |old(~a11~0)|)) (.cse5 (< |old(~a28~0)| 7)) (.cse13 (< |old(~a17~0)| 7)) (.cse2 (not (= 1 ~a21~0))) (.cse27 (< |old(~a11~0)| 0)) (.cse44 (not (= 1 |old(~a19~0)|))) (.cse8 (< 1 |old(~a25~0)|)) (.cse37 (< 11 |old(~a28~0)|)) (.cse4 (< |old(~a25~0)| 0)) (.cse32 (= ~a11~0 |old(~a11~0)|)) (.cse42 (= |old(~a17~0)| ~a17~0)) (.cse28 (= |old(~a19~0)| ~a19~0)) (.cse29 (= ~a28~0 |old(~a28~0)|)) (.cse30 (= ~a25~0 |old(~a25~0)|))) (let ((.cse20 (< |old(~a28~0)| 11)) (.cse33 (not (= ~a17~0 7))) (.cse14 (not (= 10 |old(~a28~0)|))) (.cse22 (and .cse32 .cse42 .cse28 .cse29 .cse30)) (.cse21 (not (= |old(~a17~0)| 8))) (.cse31 (<= ~a17~0 |old(~a17~0)|)) (.cse35 (= |old(~a25~0)| ~a25~0)) (.cse10 (<= 7 ~a17~0)) (.cse36 (<= ~a28~0 11)) (.cse39 (and (or .cse2 .cse27 .cse44 .cse8 .cse43 (< 21 |old(~a28~0)|) .cse4 .cse5 .cse13) (or .cse2 .cse27 .cse44 .cse8 (< |old(~a28~0)| 6) .cse37 (< |old(~a17~0)| 6) .cse4 (< 3 |old(~a11~0)|)))) (.cse1 (< 6 |calculate_output_#in~input|)) (.cse3 (= 7 |old(~a17~0)|)) (.cse26 (and (or .cse0 .cse2 .cse43 (< |old(~a28~0)| 9)) (or .cse2 .cse44 (not (= 0 |old(~a11~0)|)) .cse38 (not (= 0 |old(~a25~0)|))))) (.cse6 (< |old(~a19~0)| 0)) (.cse7 (< 10 |old(~a28~0)|)) (.cse11 (< 8 |old(~a17~0)|)) (.cse41 (and .cse9 (<= 9 ~a28~0) (= ~a21~0 1))) (.cse12 (< |calculate_output_#in~input| 1)) (.cse17 (and .cse42 .cse28 .cse40 .cse29 .cse30)) (.cse23 (< 9 |old(~a28~0)|)) (.cse15 (not .cse34)) (.cse25 (= 8 |old(~a28~0)|)) (.cse16 (= |old(~a11~0)| |old(~a19~0)|)) (.cse18 (not .cse24)) (.cse19 (< 7 |old(~a17~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 (<= 7 ~a28~0) .cse10) .cse11 .cse12 .cse13) (or .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse15 .cse20 .cse21 .cse16 .cse22) (or .cse22 .cse23 (or .cse24 .cse21)) (or .cse15 .cse25 .cse21 .cse17 .cse18) (or .cse24 .cse14 .cse22 .cse21 .cse16) (or (or .cse1 .cse26 .cse4 .cse7 .cse24 .cse27 .cse8 .cse12) (and .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) .cse21) (or .cse19 .cse34 (and .cse31 .cse28 .cse32 .cse35)) (or .cse1 .cse18 .cse5 (and .cse35 .cse36 (= ~a19~0 1) .cse32 (= ~a17~0 8)) .cse37 .cse38 .cse39 .cse12) (or (and .cse31 .cse28 .cse33 .cse40 .cse35) .cse3 .cse16 .cse18) (or .cse20 (and .cse31 .cse28 .cse33 .cse40 (<= |old(~a28~0)| ~a28~0) .cse30) .cse3 .cse18 .cse34) (or .cse1 .cse26 .cse4 .cse18 .cse6 .cse19 .cse7 (and .cse41 .cse10) .cse8 .cse16 .cse12 .cse13) (or .cse14 .cse15 .cse22 .cse21) (or .cse1 (and .cse31 .cse32 (<= 6 ~a17~0) .cse35 (or (and (<= ~a11~0 1) .cse10) .cse36) .cse28 (<= 6 ~a28~0) (<= ~a28~0 21)) .cse19 .cse39 .cse12) (or .cse1 .cse3 .cse26 .cse4 .cse18 .cse6 .cse7 .cse8 .cse11 .cse41 .cse12 .cse13) (or .cse17 .cse23 .cse15 .cse25 .cse16 .cse18 .cse19)))) [2018-10-27 12:23:13,203 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,203 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,203 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,203 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-27 12:23:13,203 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-27 12:23:13,203 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-27 12:23:13,203 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-27 12:23:13,203 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-27 12:23:13,203 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-27 12:23:13,203 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-27 12:23:13,203 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-27 12:23:13,204 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-27 12:23:13,204 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-27 12:23:13,204 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-27 12:23:13,204 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-27 12:23:13,204 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-27 12:23:13,204 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,204 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,204 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,204 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,204 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,204 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,204 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-27 12:23:13,204 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-27 12:23:13,204 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-27 12:23:13,204 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-27 12:23:13,205 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-27 12:23:13,205 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-27 12:23:13,205 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-27 12:23:13,205 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-27 12:23:13,205 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-27 12:23:13,205 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-27 12:23:13,205 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-27 12:23:13,205 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-27 12:23:13,205 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-27 12:23:13,205 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-27 12:23:13,205 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-27 12:23:13,205 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-27 12:23:13,205 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,205 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,205 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,206 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,206 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 12:23:13,206 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-27 12:23:13,206 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-27 12:23:13,206 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-27 12:23:13,206 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-27 12:23:13,206 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-27 12:23:13,206 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-27 12:23:13,206 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-27 12:23:13,206 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-27 12:23:13,206 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-27 12:23:13,206 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-27 12:23:13,206 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-27 12:23:13,206 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-27 12:23:13,206 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-27 12:23:13,206 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-27 12:23:13,207 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-27 12:23:13,207 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-27 12:23:13,207 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-27 12:23:13,207 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-27 12:23:13,207 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-27 12:23:13,207 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 12:23:13,207 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-10-27 12:23:13,207 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 12:23:13,207 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 12:23:13,207 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (and (= ~a19~0 1) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|) (= ~a11~0 |old(~a11~0)|) (= ~a17~0 8)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-27 12:23:13,207 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-27 12:23:13,208 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse8 (not (= ~a19~0 ~a11~0)))) (let ((.cse4 (and (not (= ~a17~0 7)) .cse8)) (.cse2 (<= ~a28~0 9)) (.cse0 (= ~a11~0 |old(~a11~0)|)) (.cse7 (= 10 ~a28~0)) (.cse9 (<= ~a17~0 |old(~a17~0)|)) (.cse5 (<= ~a17~0 7)) (.cse14 (not (= ~a25~0 1))) (.cse3 (= 1 ~a25~0)) (.cse6 (= 1 ~a11~0)) (.cse12 (<= 7 ~a28~0)) (.cse15 (<= 0 ~a25~0)) (.cse10 (<= ~a11~0 1)) (.cse13 (<= 0 ~a11~0)) (.cse16 (<= ~a25~0 1)) (.cse1 (= |old(~a17~0)| ~a17~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 .cse1 .cse7 .cse8) (not (= 1 |old(~a19~0)|)) (and .cse9 .cse6 .cse4) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse5 (let ((.cse11 (= ~a19~0 1))) (or (and .cse10 (<= ~a28~0 21) .cse11 .cse12 .cse13 (<= 7 ~a17~0)) (and (<= ~a28~0 11) (<= 6 ~a28~0) (<= 6 ~a17~0) .cse11 (<= ~a11~0 3) .cse13)))) (and (not (= ~a28~0 8)) .cse5 .cse6 .cse8 .cse2) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (and .cse0 .cse1 .cse3 .cse7) (and (<= 11 ~a28~0) .cse9 .cse14 .cse6) (not (= 0 |old(~a25~0)|)) (and .cse5 .cse14) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (and .cse6 .cse1 .cse3) (not (= |old(~a28~0)| 7)) (and .cse6 (and .cse15 (= ~a17~0 8) .cse12 .cse16)) (not (= ~a~0 1)) (and (and (<= 1 main_~input~0) (<= main_~input~0 6) (and .cse15 .cse10 (<= ~a28~0 10) (<= 9 ~a28~0) .cse13 .cse16)) .cse1) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0))))) [2018-10-27 12:23:13,208 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-27 12:23:13,208 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-27 12:23:13,208 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse6 (not (= ~a19~0 ~a11~0))) (.cse2 (<= ~a28~0 9)) (.cse0 (= ~a11~0 |old(~a11~0)|)) (.cse5 (= 10 ~a28~0)) (.cse12 (<= ~a17~0 |old(~a17~0)|)) (.cse3 (<= ~a17~0 7)) (.cse16 (not (= ~a25~0 1))) (.cse14 (= 1 ~a25~0)) (.cse15 (not (= ~a28~0 8))) (.cse9 (<= ~a11~0 1)) (.cse10 (<= 0 ~a11~0)) (.cse1 (= |old(~a17~0)| ~a17~0)) (.cse7 (<= 1 main_~input~0)) (.cse8 (<= main_~input~0 6)) (.cse18 (<= ~a25~0 1)) (.cse17 (<= 0 ~a25~0)) (.cse13 (not (= ~a17~0 7))) (.cse4 (= 1 ~a11~0)) (.cse11 (<= 7 ~a17~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse0 .cse1 .cse5 .cse6) (and .cse7 .cse8 (or (and .cse9 .cse10 .cse11) (and (<= ~a28~0 11) (<= 6 ~a17~0) .cse10)) (<= 6 ~a28~0) .cse3 (<= ~a28~0 21) (= ~a19~0 1) (<= ~a11~0 3)) (and .cse12 .cse13 .cse4 .cse6) (not (= 1 |old(~a19~0)|)) (and .cse0 .cse1 .cse14 .cse6) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse15 .cse3 .cse4 .cse6 .cse2) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (not (= ~z~0 26)) (and .cse0 .cse1 .cse14 .cse5) (and (<= 11 ~a28~0) .cse12 .cse16 .cse4) (not (= 0 |old(~a25~0)|)) (and .cse3 .cse16) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (and .cse4 .cse1 .cse14 .cse15) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (and (and .cse7 .cse8 (and .cse17 .cse9 (<= ~a28~0 10) (<= 9 ~a28~0) .cse10 .cse18)) .cse1) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)) (and .cse7 .cse8 (<= 7 ~a28~0) .cse18 .cse17 .cse13 .cse4 (<= ~a17~0 8) .cse11))) [2018-10-27 12:23:13,208 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-27 12:23:13,208 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-27 12:23:13,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:23:13 BoogieIcfgContainer [2018-10-27 12:23:13,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 12:23:13,236 INFO L168 Benchmark]: Toolchain (without parser) took 121962.58 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -767.7 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-27 12:23:13,241 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 12:23:13,241 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.19 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 12:23:13,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 206.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-27 12:23:13,243 INFO L168 Benchmark]: Boogie Preprocessor took 117.21 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 12:23:13,243 INFO L168 Benchmark]: RCFGBuilder took 3286.24 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: 104.9 MB). Peak memory consumption was 104.9 MB. Max. memory is 7.1 GB. [2018-10-27 12:23:13,244 INFO L168 Benchmark]: TraceAbstraction took 117592.72 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -88.7 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-27 12:23:13,254 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 754.19 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 206.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.21 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 3286.24 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: 104.9 MB). Peak memory consumption was 104.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 117592.72 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -88.7 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 529]: 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: ((((((((((((((((((((((((((((((a11 == \old(a11) && \old(a17) == a17) && a28 <= 9) || (((a11 == \old(a11) && \old(a17) == a17) && 1 == a25) && !(a17 == 7) && !(a19 == a11))) || (((a17 <= 7 && 1 == a11) && 10 == a28) && !(a19 == a11))) || !(a21 == 1)) || !(y == 25)) || (((a11 == \old(a11) && \old(a17) == a17) && 10 == a28) && !(a19 == a11))) || !(1 == \old(a19))) || ((a17 <= \old(a17) && 1 == a11) && !(a17 == 7) && !(a19 == a11))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || (a17 <= 7 && ((((((a11 <= 1 && a28 <= 21) && a19 == 1) && 7 <= a28) && 0 <= a11) && 7 <= a17) || (((((a28 <= 11 && 6 <= a28) && 6 <= a17) && a19 == 1) && a11 <= 3) && 0 <= a11)))) || ((((!(a28 == 8) && a17 <= 7) && 1 == a11) && !(a19 == a11)) && a28 <= 9)) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || !(z == 26)) || (((a11 == \old(a11) && \old(a17) == a17) && 1 == a25) && 10 == a28)) || (((11 <= a28 && a17 <= \old(a17)) && !(a25 == 1)) && 1 == a11)) || !(0 == \old(a25))) || (a17 <= 7 && !(a25 == 1))) || !(3 == c)) || !(23 == w)) || ((1 == a11 && \old(a17) == a17) && 1 == a25)) || !(\old(a28) == 7)) || (1 == a11 && ((0 <= a25 && a17 == 8) && 7 <= a28) && a25 <= 1)) || !(a == 1)) || (((1 <= input && input <= 6) && ((((0 <= a25 && a11 <= 1) && a28 <= 10) && 9 <= a28) && 0 <= a11) && a25 <= 1) && \old(a17) == a17)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 117.4s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 78.4s AutomataDifference, 0.0s DeadEndRemovalTime, 12.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1912 SDtfs, 13772 SDslu, 3496 SDs, 0 SdLazy, 20452 SolverSat, 3621 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.8s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 3428 GetRequests, 3125 SyntacticMatches, 48 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1775 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8249occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 11.0s AbstIntTime, 10 AbstIntIterations, 6 AbstIntStrong, 0.9969316688844528 AbsIntWeakeningRatio, 0.21062618595825428 AbsIntAvgWeakeningVarsNumRemoved, 29.010436432637572 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 3061 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 297 PreInvPairs, 402 NumberOfFragments, 1636 HoareAnnotationTreeSize, 297 FomulaSimplifications, 51573 FormulaSimplificationTreeSizeReduction, 2.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 54961 FormulaSimplificationTreeSizeReductionInter, 10.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 3599 NumberOfCodeBlocks, 3599 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 4639 ConstructedInterpolants, 0 QuantifiedInterpolants, 2186922 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2488 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 3903/4255 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...