java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:04:23,254 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:04:23,258 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:04:23,275 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:04:23,276 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:04:23,277 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:04:23,278 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:04:23,280 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:04:23,282 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:04:23,283 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:04:23,283 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:04:23,284 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:04:23,285 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:04:23,286 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:04:23,287 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:04:23,288 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:04:23,288 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:04:23,290 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:04:23,296 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:04:23,297 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:04:23,301 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:04:23,302 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:04:23,308 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:04:23,308 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:04:23,308 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:04:23,309 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:04:23,313 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:04:23,314 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:04:23,314 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:04:23,315 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:04:23,316 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:04:23,316 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:04:23,317 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:04:23,317 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:04:23,318 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:04:23,318 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:04:23,319 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:04:23,343 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:04:23,344 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:04:23,344 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:04:23,345 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:04:23,345 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:04:23,345 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:04:23,345 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:04:23,345 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:04:23,346 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:04:23,346 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:04:23,346 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:04:23,346 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:04:23,346 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:04:23,347 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:04:23,347 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:04:23,348 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:04:23,348 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:04:23,348 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:04:23,348 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:04:23,348 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:04:23,349 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:04:23,349 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:04:23,349 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:04:23,349 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:04:23,349 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:04:23,350 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:04:23,350 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:04:23,350 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:04:23,350 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:04:23,350 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:04:23,351 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:04:23,351 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:04:23,351 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:04:23,351 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:04:23,351 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:04:23,352 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:04:23,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:04:23,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:04:23,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:04:23,419 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:04:23,420 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:04:23,421 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c [2018-10-25 00:04:23,497 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0a8d337ba/391f2441e202489e9052a8f1aa93b731/FLAG3b6bdad49 [2018-10-25 00:04:24,092 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:04:24,093 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label05_true-unreach-call_false-termination.c [2018-10-25 00:04:24,109 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0a8d337ba/391f2441e202489e9052a8f1aa93b731/FLAG3b6bdad49 [2018-10-25 00:04:24,130 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0a8d337ba/391f2441e202489e9052a8f1aa93b731 [2018-10-25 00:04:24,143 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:04:24,145 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:04:24,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:04:24,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:04:24,151 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:04:24,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:04:24" (1/1) ... [2018-10-25 00:04:24,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c49ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:24, skipping insertion in model container [2018-10-25 00:04:24,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:04:24" (1/1) ... [2018-10-25 00:04:24,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:04:24,233 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:04:24,779 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:04:24,787 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:04:24,909 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:04:24,928 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:04:24,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:24 WrapperNode [2018-10-25 00:04:24,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:04:24,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:04:24,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:04:24,930 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:04:24,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:24" (1/1) ... [2018-10-25 00:04:24,975 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:24" (1/1) ... [2018-10-25 00:04:25,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:04:25,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:04:25,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:04:25,123 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:04:25,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:24" (1/1) ... [2018-10-25 00:04:25,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:24" (1/1) ... [2018-10-25 00:04:25,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:24" (1/1) ... [2018-10-25 00:04:25,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:24" (1/1) ... [2018-10-25 00:04:25,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:24" (1/1) ... [2018-10-25 00:04:25,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:24" (1/1) ... [2018-10-25 00:04:25,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:24" (1/1) ... [2018-10-25 00:04:25,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:04:25,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:04:25,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:04:25,207 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:04:25,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:24" (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-25 00:04:25,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:04:25,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:04:25,286 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:04:25,286 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:04:25,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:04:25,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:04:25,287 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:04:25,287 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:04:28,709 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:04:28,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:04:28 BoogieIcfgContainer [2018-10-25 00:04:28,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:04:28,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:04:28,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:04:28,715 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:04:28,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:04:24" (1/3) ... [2018-10-25 00:04:28,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6355c602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:04:28, skipping insertion in model container [2018-10-25 00:04:28,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:24" (2/3) ... [2018-10-25 00:04:28,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6355c602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:04:28, skipping insertion in model container [2018-10-25 00:04:28,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:04:28" (3/3) ... [2018-10-25 00:04:28,719 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label05_true-unreach-call_false-termination.c [2018-10-25 00:04:28,730 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:04:28,742 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:04:28,764 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:04:28,816 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:04:28,816 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:04:28,816 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:04:28,816 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:04:28,817 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:04:28,817 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:04:28,817 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:04:28,817 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:04:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-25 00:04:28,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-25 00:04:28,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:28,873 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:28,877 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:28,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:28,883 INFO L82 PathProgramCache]: Analyzing trace with hash -782709097, now seen corresponding path program 1 times [2018-10-25 00:04:28,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:28,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:28,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:28,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:28,946 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:29,641 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-25 00:04:29,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:29,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:04:29,644 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:29,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:04:29,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:04:29,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:04:29,673 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-25 00:04:31,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:31,204 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-10-25 00:04:31,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:04:31,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2018-10-25 00:04:31,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:31,226 INFO L225 Difference]: With dead ends: 621 [2018-10-25 00:04:31,226 INFO L226 Difference]: Without dead ends: 382 [2018-10-25 00:04:31,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:04:31,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-25 00:04:31,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-25 00:04:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-25 00:04:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-10-25 00:04:31,313 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 133 [2018-10-25 00:04:31,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:31,315 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-10-25 00:04:31,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:04:31,315 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-10-25 00:04:31,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-25 00:04:31,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:31,323 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:31,324 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:31,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:31,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1001431126, now seen corresponding path program 1 times [2018-10-25 00:04:31,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:31,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:31,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:31,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:31,326 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:31,926 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-25 00:04:32,150 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-25 00:04:32,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:32,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:32,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:04:32,231 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:32,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:04:32,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:04:32,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:04:32,233 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-10-25 00:04:33,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:33,995 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-10-25 00:04:33,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:04:33,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2018-10-25 00:04:33,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:34,000 INFO L225 Difference]: With dead ends: 903 [2018-10-25 00:04:34,000 INFO L226 Difference]: Without dead ends: 381 [2018-10-25 00:04:34,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:04:34,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-25 00:04:34,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-25 00:04:34,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-25 00:04:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-10-25 00:04:34,032 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 142 [2018-10-25 00:04:34,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:34,032 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-10-25 00:04:34,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:04:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-10-25 00:04:34,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-25 00:04:34,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:34,037 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:34,037 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:34,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:34,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1638990538, now seen corresponding path program 1 times [2018-10-25 00:04:34,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:34,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:34,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:34,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:34,040 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:34,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:34,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:34,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:04:34,541 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:34,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:04:34,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:04:34,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:04:34,543 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-10-25 00:04:36,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:36,221 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-10-25 00:04:36,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:04:36,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2018-10-25 00:04:36,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:36,229 INFO L225 Difference]: With dead ends: 901 [2018-10-25 00:04:36,230 INFO L226 Difference]: Without dead ends: 380 [2018-10-25 00:04:36,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:04:36,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-25 00:04:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-25 00:04:36,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-25 00:04:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-10-25 00:04:36,267 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 148 [2018-10-25 00:04:36,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:36,268 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-10-25 00:04:36,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:04:36,268 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-10-25 00:04:36,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-25 00:04:36,274 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:36,274 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:36,275 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:36,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:36,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2027073139, now seen corresponding path program 1 times [2018-10-25 00:04:36,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:36,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:36,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:36,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:36,277 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:36,455 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-25 00:04:36,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:36,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:04:36,456 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:36,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:04:36,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:04:36,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:04:36,457 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-10-25 00:04:39,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:39,504 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-10-25 00:04:39,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:04:39,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2018-10-25 00:04:39,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:39,511 INFO L225 Difference]: With dead ends: 1193 [2018-10-25 00:04:39,511 INFO L226 Difference]: Without dead ends: 819 [2018-10-25 00:04:39,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:04:39,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-25 00:04:39,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-10-25 00:04:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-10-25 00:04:39,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-10-25 00:04:39,555 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 156 [2018-10-25 00:04:39,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:39,556 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-10-25 00:04:39,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:04:39,556 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-10-25 00:04:39,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-25 00:04:39,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:39,560 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:39,560 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:39,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:39,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1763589615, now seen corresponding path program 1 times [2018-10-25 00:04:39,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:39,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:39,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:39,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:39,562 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:39,934 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:39,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:39,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:04:39,935 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:39,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:04:39,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:04:39,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:04:39,936 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-10-25 00:04:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:41,024 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-10-25 00:04:41,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:04:41,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2018-10-25 00:04:41,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:41,031 INFO L225 Difference]: With dead ends: 1753 [2018-10-25 00:04:41,031 INFO L226 Difference]: Without dead ends: 804 [2018-10-25 00:04:41,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:04:41,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-25 00:04:41,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-10-25 00:04:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-10-25 00:04:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-10-25 00:04:41,061 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 158 [2018-10-25 00:04:41,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:41,061 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-10-25 00:04:41,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:04:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-10-25 00:04:41,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-25 00:04:41,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:41,065 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:41,066 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:41,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:41,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1311761045, now seen corresponding path program 1 times [2018-10-25 00:04:41,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:41,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:41,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:41,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:41,068 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:41,489 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-25 00:04:41,742 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-25 00:04:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:41,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:41,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:04:41,821 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:41,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:04:41,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:04:41,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:04:41,822 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-10-25 00:04:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:43,510 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-10-25 00:04:43,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:04:43,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2018-10-25 00:04:43,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:43,517 INFO L225 Difference]: With dead ends: 1747 [2018-10-25 00:04:43,518 INFO L226 Difference]: Without dead ends: 801 [2018-10-25 00:04:43,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:04:43,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-25 00:04:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-10-25 00:04:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-10-25 00:04:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-10-25 00:04:43,559 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 160 [2018-10-25 00:04:43,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:43,559 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-10-25 00:04:43,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:04:43,559 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-10-25 00:04:43,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-25 00:04:43,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:43,565 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:43,565 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:43,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:43,566 INFO L82 PathProgramCache]: Analyzing trace with hash -269929571, now seen corresponding path program 1 times [2018-10-25 00:04:43,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:43,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:43,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:43,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:43,578 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:43,836 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:04:44,057 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:44,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:44,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:04:44,058 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:44,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:04:44,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:04:44,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:04:44,059 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-10-25 00:04:45,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:45,173 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-10-25 00:04:45,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:04:45,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-10-25 00:04:45,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:45,184 INFO L225 Difference]: With dead ends: 2381 [2018-10-25 00:04:45,184 INFO L226 Difference]: Without dead ends: 1586 [2018-10-25 00:04:45,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:04:45,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-10-25 00:04:45,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-10-25 00:04:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-10-25 00:04:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-10-25 00:04:45,254 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 164 [2018-10-25 00:04:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:45,255 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-10-25 00:04:45,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:04:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-10-25 00:04:45,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-25 00:04:45,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:45,263 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:45,263 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:45,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:45,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1973584945, now seen corresponding path program 1 times [2018-10-25 00:04:45,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:45,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:45,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:45,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:45,266 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:45,472 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:45,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:45,472 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:04:45,473 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-10-25 00:04:45,475 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [735], [737], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:04:45,524 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:04:45,524 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:04:46,753 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:04:46,757 INFO L272 AbstractInterpreter]: Visited 137 different actions 268 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-25 00:04:46,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:46,798 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:04:48,289 INFO L232 lantSequenceWeakener]: Weakened 151 states. On average, predicates are now at 81.46% of their original sizes. [2018-10-25 00:04:48,290 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:04:52,803 INFO L413 sIntCurrentIteration]: We have 198 unified AI predicates [2018-10-25 00:04:52,804 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:04:52,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:04:52,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2018-10-25 00:04:52,805 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:52,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-25 00:04:52,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-25 00:04:52,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:04:52,807 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 18 states. [2018-10-25 00:05:12,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:12,561 INFO L93 Difference]: Finished difference Result 4236 states and 6014 transitions. [2018-10-25 00:05:12,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-25 00:05:12,561 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 199 [2018-10-25 00:05:12,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:12,576 INFO L225 Difference]: With dead ends: 4236 [2018-10-25 00:05:12,576 INFO L226 Difference]: Without dead ends: 2684 [2018-10-25 00:05:12,583 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 214 GetRequests, 63 SyntacticMatches, 119 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=224, Invalid=898, Unknown=0, NotChecked=0, Total=1122 [2018-10-25 00:05:12,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2018-10-25 00:05:12,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2459. [2018-10-25 00:05:12,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2459 states. [2018-10-25 00:05:12,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3247 transitions. [2018-10-25 00:05:12,653 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3247 transitions. Word has length 199 [2018-10-25 00:05:12,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:12,654 INFO L481 AbstractCegarLoop]: Abstraction has 2459 states and 3247 transitions. [2018-10-25 00:05:12,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-25 00:05:12,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3247 transitions. [2018-10-25 00:05:12,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-25 00:05:12,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:12,664 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:05:12,664 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:12,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:12,665 INFO L82 PathProgramCache]: Analyzing trace with hash 929493308, now seen corresponding path program 1 times [2018-10-25 00:05:12,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:12,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:12,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:12,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:12,666 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:12,912 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:05:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:05:13,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:13,066 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:13,066 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-10-25 00:05:13,067 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [119], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [735], [737], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:05:13,073 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:13,073 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:13,612 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:05:13,612 INFO L272 AbstractInterpreter]: Visited 139 different actions 414 times. Merged at 8 different actions 21 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:05:13,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:13,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:05:13,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:13,620 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-25 00:05:13,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:13,629 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:05:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:13,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:05:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:05:14,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:05:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:05:14,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:05:14,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-10-25 00:05:14,854 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:05:14,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-25 00:05:14,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-25 00:05:14,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:05:14,858 INFO L87 Difference]: Start difference. First operand 2459 states and 3247 transitions. Second operand 14 states. [2018-10-25 00:05:19,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:19,814 INFO L93 Difference]: Finished difference Result 7753 states and 10800 transitions. [2018-10-25 00:05:19,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:05:19,815 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 204 [2018-10-25 00:05:19,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:19,833 INFO L225 Difference]: With dead ends: 7753 [2018-10-25 00:05:19,833 INFO L226 Difference]: Without dead ends: 3766 [2018-10-25 00:05:19,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 420 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-10-25 00:05:19,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3766 states. [2018-10-25 00:05:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3766 to 3740. [2018-10-25 00:05:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3740 states. [2018-10-25 00:05:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 4372 transitions. [2018-10-25 00:05:19,964 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 4372 transitions. Word has length 204 [2018-10-25 00:05:19,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:19,968 INFO L481 AbstractCegarLoop]: Abstraction has 3740 states and 4372 transitions. [2018-10-25 00:05:19,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-25 00:05:19,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 4372 transitions. [2018-10-25 00:05:19,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-25 00:05:19,977 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:19,977 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:05:19,977 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:19,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:19,978 INFO L82 PathProgramCache]: Analyzing trace with hash -795997850, now seen corresponding path program 1 times [2018-10-25 00:05:19,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:19,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:19,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:19,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:19,979 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:05:20,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:20,289 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:20,289 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 221 with the following transitions: [2018-10-25 00:05:20,290 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [324], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [735], [737], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:05:20,296 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:20,296 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:21,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:05:21,276 INFO L272 AbstractInterpreter]: Visited 138 different actions 412 times. Merged at 7 different actions 22 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:05:21,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:21,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:05:21,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:21,314 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-25 00:05:21,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:21,332 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:05:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:21,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:05:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:05:21,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:05:22,103 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:05:22,137 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:05:22,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-10-25 00:05:22,138 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:22,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:05:22,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:05:22,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:05:22,139 INFO L87 Difference]: Start difference. First operand 3740 states and 4372 transitions. Second operand 3 states. [2018-10-25 00:05:23,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:23,382 INFO L93 Difference]: Finished difference Result 7088 states and 8441 transitions. [2018-10-25 00:05:23,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:05:23,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-10-25 00:05:23,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:23,383 INFO L225 Difference]: With dead ends: 7088 [2018-10-25 00:05:23,383 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:05:23,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 438 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:05:23,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:05:23,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:05:23,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:05:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:05:23,399 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2018-10-25 00:05:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:23,399 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:05:23,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:05:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:05:23,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:05:23,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:05:23,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:23,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:23,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:23,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:23,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:23,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:23,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:23,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:23,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:23,684 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 74 [2018-10-25 00:05:23,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:23,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:23,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:23,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:23,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:23,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:23,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:23,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:23,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:23,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:24,725 WARN L179 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2018-10-25 00:05:25,425 WARN L179 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 77 [2018-10-25 00:05:27,170 WARN L179 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 261 DAG size of output: 82 [2018-10-25 00:05:27,833 WARN L179 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 97 [2018-10-25 00:05:28,493 WARN L179 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 97 [2018-10-25 00:05:28,496 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:05:28,497 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a17~0)| ~a17~0) (= |old(~a25~0)| ~a25~0) (= ~a28~0 |old(~a28~0)|)) [2018-10-25 00:05:28,497 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:05:28,497 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,497 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,497 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,497 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,497 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,497 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-25 00:05:28,498 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-25 00:05:28,498 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-25 00:05:28,498 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-25 00:05:28,498 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-25 00:05:28,498 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-25 00:05:28,498 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-25 00:05:28,498 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-25 00:05:28,499 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-25 00:05:28,499 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-25 00:05:28,499 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:05:28,499 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:05:28,499 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-25 00:05:28,499 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,499 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,499 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,500 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,500 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-25 00:05:28,500 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,500 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-25 00:05:28,500 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-25 00:05:28,500 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-25 00:05:28,500 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-25 00:05:28,500 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-25 00:05:28,501 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-25 00:05:28,501 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-25 00:05:28,501 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:05:28,501 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:05:28,501 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-25 00:05:28,501 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-25 00:05:28,501 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-25 00:05:28,501 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:05:28,502 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:05:28,502 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-25 00:05:28,502 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,502 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,502 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,502 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,502 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,503 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:05:28,503 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-25 00:05:28,503 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:05:28,503 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-25 00:05:28,503 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-25 00:05:28,503 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-25 00:05:28,503 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-25 00:05:28,503 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-25 00:05:28,504 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-25 00:05:28,504 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-25 00:05:28,504 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-25 00:05:28,504 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,504 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,504 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,504 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,504 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,505 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-25 00:05:28,505 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-25 00:05:28,505 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-25 00:05:28,505 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-25 00:05:28,505 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-25 00:05:28,505 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-25 00:05:28,505 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-25 00:05:28,505 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-25 00:05:28,505 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-25 00:05:28,506 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-25 00:05:28,506 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-25 00:05:28,506 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-25 00:05:28,506 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-25 00:05:28,506 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,506 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,506 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,506 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,507 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,507 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-25 00:05:28,507 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 550) no Hoare annotation was computed. [2018-10-25 00:05:28,507 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-25 00:05:28,507 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-25 00:05:28,507 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-25 00:05:28,508 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-25 00:05:28,508 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-25 00:05:28,508 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-25 00:05:28,508 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-25 00:05:28,508 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-25 00:05:28,508 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-25 00:05:28,508 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-25 00:05:28,508 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-25 00:05:28,509 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-25 00:05:28,509 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:05:28,509 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-25 00:05:28,509 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:05:28,509 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,509 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,509 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,509 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,510 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-25 00:05:28,510 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,510 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:05:28,510 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,510 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:05:28,510 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:05:28,510 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:05:28,510 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,511 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,511 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-25 00:05:28,511 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-25 00:05:28,511 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-25 00:05:28,511 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-25 00:05:28,511 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-25 00:05:28,511 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-25 00:05:28,511 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-25 00:05:28,512 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-25 00:05:28,512 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-25 00:05:28,512 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-25 00:05:28,512 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-25 00:05:28,512 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,512 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,512 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,512 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,513 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,513 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,513 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-25 00:05:28,513 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-25 00:05:28,513 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-25 00:05:28,513 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-25 00:05:28,513 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-25 00:05:28,513 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-25 00:05:28,513 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-25 00:05:28,514 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-25 00:05:28,514 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-25 00:05:28,514 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-25 00:05:28,514 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-25 00:05:28,514 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,514 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,514 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,514 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,515 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,515 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,515 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-25 00:05:28,515 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-25 00:05:28,515 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-25 00:05:28,515 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-25 00:05:28,515 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-25 00:05:28,515 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-25 00:05:28,515 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-25 00:05:28,515 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-25 00:05:28,516 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-25 00:05:28,516 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-25 00:05:28,516 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-25 00:05:28,516 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-25 00:05:28,516 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-25 00:05:28,516 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-25 00:05:28,516 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,516 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,516 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,517 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse20 (= |old(~a17~0)| ~a17~0)) (.cse18 (= |old(~a25~0)| ~a25~0)) (.cse21 (= ~a28~0 |old(~a28~0)|)) (.cse19 (= 1 |old(~a19~0)|)) (.cse1 (= 1 |old(~a11~0)|)) (.cse17 (= 1 |old(~a25~0)|))) (let ((.cse13 (= 9 |old(~a28~0)|)) (.cse16 (= 8 ~a17~0)) (.cse8 (not .cse17)) (.cse7 (not (= 7 |old(~a28~0)|))) (.cse11 (= 1 ~a11~0)) (.cse12 (= 1 ~a19~0)) (.cse10 (not .cse1)) (.cse9 (not .cse19)) (.cse15 (not (= 8 |old(~a17~0)|))) (.cse5 (< 9 |old(~a28~0)|)) (.cse3 (not (= ~a11~0 1))) (.cse14 (not (= |old(~a17~0)| 8))) (.cse0 (not (= 1 ~a21~0))) (.cse2 (= 8 |old(~a28~0)|)) (.cse4 (< 7 |old(~a17~0)|)) (.cse6 (and .cse20 .cse18 .cse21))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse5 .cse2 .cse6 .cse4) (or .cse0 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12) (not (= 7 |old(~a17~0)|))) (or .cse0 .cse5 .cse6 .cse2 .cse13 .cse14) (or .cse0 .cse8 .cse9 .cse15 (and .cse11 (= 1 ~a25~0) (= 9 ~a28~0) .cse16 .cse12) (not .cse13) .cse10) (or .cse0 .cse2 .cse6 .cse4 .cse17) (or (and .cse11 .cse16 .cse12 .cse18 (= 10 ~a28~0)) .cse0 (not (= 10 |old(~a28~0)|)) .cse8 .cse9 .cse15 .cse10) (or .cse19 .cse0 .cse7 .cse15 (and .cse11 (not .cse12)) .cse10 .cse17) (or (and (= ~a11~0 0) (= ~a19~0 1)) (or .cse0 .cse9 (= 0 |old(~a28~0)|) (not (= 0 |old(~a11~0)|)) .cse15 (= |calculate_output_#in~input| 0))) (or .cse0 .cse5 .cse2 .cse6 .cse14 .cse17) (or .cse0 (and .cse20 .cse18 .cse21 .cse3) .cse1 .cse14) (or .cse0 .cse1 .cse2 .cse4 .cse6)))) [2018-10-25 00:05:28,517 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,517 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,517 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,517 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-25 00:05:28,518 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-25 00:05:28,518 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-25 00:05:28,518 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-25 00:05:28,518 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-25 00:05:28,518 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-25 00:05:28,518 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-25 00:05:28,518 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-25 00:05:28,518 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-25 00:05:28,518 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-25 00:05:28,519 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-25 00:05:28,519 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-25 00:05:28,519 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-25 00:05:28,519 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,519 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,519 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,519 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,520 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,520 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,520 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-25 00:05:28,520 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-25 00:05:28,520 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-25 00:05:28,520 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-25 00:05:28,520 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-25 00:05:28,520 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-25 00:05:28,520 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-25 00:05:28,520 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-25 00:05:28,521 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-25 00:05:28,521 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-25 00:05:28,521 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-25 00:05:28,521 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:05:28,521 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:05:28,521 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-25 00:05:28,521 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-25 00:05:28,521 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-25 00:05:28,521 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,522 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,522 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,522 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,522 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:05:28,522 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-25 00:05:28,522 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-25 00:05:28,522 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-25 00:05:28,522 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-25 00:05:28,522 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-25 00:05:28,523 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-25 00:05:28,523 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-25 00:05:28,523 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-25 00:05:28,523 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-25 00:05:28,523 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-25 00:05:28,523 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-25 00:05:28,523 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:05:28,523 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-25 00:05:28,523 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:05:28,524 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-25 00:05:28,524 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:05:28,524 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:05:28,524 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-25 00:05:28,524 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-25 00:05:28,524 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:05:28,524 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-25 00:05:28,525 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:05:28,525 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:05:28,525 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (and (= ~a11~0 0) (= ~a25~0 0) (= ~a19~0 1) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= |old(~a11~0)| 0)) (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-25 00:05:28,525 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-25 00:05:28,525 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse3 (= 8 ~a17~0)) (.cse4 (= 1 ~a19~0)) (.cse6 (not (= ~a11~0 1))) (.cse5 (= |old(~a17~0)| ~a17~0)) (.cse2 (<= ~a28~0 9)) (.cse0 (<= ~a17~0 7)) (.cse7 (not (= ~a25~0 1))) (.cse1 (not (= ~a28~0 8)))) (or (and .cse0 .cse1 .cse2) (and (= 9 ~a28~0) .cse3 .cse4) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse5 .cse6) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and (= 1 ~a25~0) .cse3 .cse4 (= 10 ~a28~0)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse5 .cse1 .cse2 (not (= ~a28~0 9))) (not (= |old(~a11~0)| 0)) (and .cse0 .cse1 .cse6) (not (= ~z~0 26)) (and .cse7 .cse5 .cse1 .cse2) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (and .cse0 .cse7 .cse1) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-10-25 00:05:28,526 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:05:28,526 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:05:28,526 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse3 (= 8 ~a17~0)) (.cse4 (= 1 ~a19~0)) (.cse6 (not (= ~a11~0 1))) (.cse5 (= |old(~a17~0)| ~a17~0)) (.cse2 (<= ~a28~0 9)) (.cse0 (<= ~a17~0 7)) (.cse7 (not (= ~a25~0 1))) (.cse1 (not (= ~a28~0 8)))) (or (and .cse0 .cse1 .cse2) (and (= 9 ~a28~0) .cse3 .cse4) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse5 .cse6) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and (= 1 ~a25~0) .cse3 .cse4 (= 10 ~a28~0)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse5 .cse1 .cse2 (not (= ~a28~0 9))) (not (= |old(~a11~0)| 0)) (and .cse0 .cse1 .cse6) (not (= ~z~0 26)) (and .cse7 .cse5 .cse1 .cse2) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (and .cse0 .cse7 .cse1) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-10-25 00:05:28,526 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-25 00:05:28,526 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-25 00:05:28,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:05:28 BoogieIcfgContainer [2018-10-25 00:05:28,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:05:28,547 INFO L168 Benchmark]: Toolchain (without parser) took 64403.60 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-25 00:05:28,549 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-25 00:05:28,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.38 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-25 00:05:28,553 INFO L168 Benchmark]: Boogie Procedure Inliner took 192.92 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -835.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:05:28,554 INFO L168 Benchmark]: Boogie Preprocessor took 84.05 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-25 00:05:28,555 INFO L168 Benchmark]: RCFGBuilder took 3503.62 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: 115.0 MB). Peak memory consumption was 115.0 MB. Max. memory is 7.1 GB. [2018-10-25 00:05:28,555 INFO L168 Benchmark]: TraceAbstraction took 59831.51 ms. Allocated memory was 2.3 GB in the beginning and 3.4 GB in the end (delta: 1.2 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-10-25 00:05:28,560 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 782.38 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 192.92 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -835.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 84.05 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 3503.62 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: 115.0 MB). Peak memory consumption was 115.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 59831.51 ms. Allocated memory was 2.3 GB in the beginning and 3.4 GB in the end (delta: 1.2 GB). Free memory was 2.1 GB in the beginning and 3.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 550]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((a17 <= 7 && !(a28 == 8)) && a28 <= 9) || ((9 == a28 && 8 == a17) && 1 == a19)) || !(a21 == 1)) || !(y == 25)) || (\old(a17) == a17 && !(a11 == 1))) || !(1 == \old(a19))) || !(x == 24)) || (((1 == a25 && 8 == a17) && 1 == a19) && 10 == a28)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || (((\old(a17) == a17 && !(a28 == 8)) && a28 <= 9) && !(a28 == 9))) || !(\old(a11) == 0)) || ((a17 <= 7 && !(a28 == 8)) && !(a11 == 1))) || !(z == 26)) || (((!(a25 == 1) && \old(a17) == a17) && !(a28 == 8)) && a28 <= 9)) || !(0 == \old(a25))) || !(3 == c)) || !(23 == w)) || ((a17 <= 7 && !(a25 == 1)) && !(a28 == 8))) || !(\old(a28) == 7)) || !(a == 1)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 59.7s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 38.0s AutomataDifference, 0.0s DeadEndRemovalTime, 5.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1205 SDtfs, 8181 SDslu, 1263 SDs, 0 SdLazy, 11085 SolverSat, 1927 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1168 GetRequests, 943 SyntacticMatches, 129 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1329 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3740occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.9s AbstIntTime, 3 AbstIntIterations, 1 AbstIntStrong, 0.9977502202992401 AbsIntWeakeningRatio, 0.16666666666666666 AbsIntAvgWeakeningVarsNumRemoved, 0.12626262626262627 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 291 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 105 PreInvPairs, 183 NumberOfFragments, 834 HoareAnnotationTreeSize, 105 FomulaSimplifications, 6233 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 5218 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 2108 NumberOfCodeBlocks, 2108 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2518 ConstructedInterpolants, 0 QuantifiedInterpolants, 2058946 SizeOfPredicates, 2 NumberOfNonLiveVariables, 990 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 791/827 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...