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_label14_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:12:10,156 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:12:10,158 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:12:10,175 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:12:10,176 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:12:10,177 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:12:10,178 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:12:10,180 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:12:10,181 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:12:10,182 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:12:10,183 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:12:10,183 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:12:10,184 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:12:10,185 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:12:10,186 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:12:10,187 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:12:10,188 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:12:10,190 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:12:10,192 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:12:10,194 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:12:10,195 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:12:10,196 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:12:10,198 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:12:10,199 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:12:10,199 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:12:10,200 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:12:10,201 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:12:10,202 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:12:10,203 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:12:10,204 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:12:10,204 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:12:10,205 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:12:10,205 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:12:10,205 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:12:10,206 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:12:10,207 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:12:10,207 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-27 06:12:10,222 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:12:10,223 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:12:10,224 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 06:12:10,224 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 06:12:10,224 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 06:12:10,224 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 06:12:10,224 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 06:12:10,225 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 06:12:10,225 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 06:12:10,225 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 06:12:10,225 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 06:12:10,225 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 06:12:10,225 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 06:12:10,226 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 06:12:10,226 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:12:10,227 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:12:10,227 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:12:10,227 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 06:12:10,227 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 06:12:10,227 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 06:12:10,228 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:12:10,228 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 06:12:10,228 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:12:10,228 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:12:10,228 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 06:12:10,229 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 06:12:10,229 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 06:12:10,229 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:12:10,229 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 06:12:10,229 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 06:12:10,230 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 06:12:10,230 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 06:12:10,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 06:12:10,230 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 06:12:10,230 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 06:12:10,230 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 06:12:10,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:12:10,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:12:10,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:12:10,297 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:12:10,297 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:12:10,298 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label14_true-unreach-call_false-termination.c [2018-10-27 06:12:10,365 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/447dcfee6/877a5ca9b7d34cd9b49f75e48e860ce6/FLAG4964c3e82 [2018-10-27 06:12:10,917 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:12:10,918 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label14_true-unreach-call_false-termination.c [2018-10-27 06:12:10,930 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/447dcfee6/877a5ca9b7d34cd9b49f75e48e860ce6/FLAG4964c3e82 [2018-10-27 06:12:10,945 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/447dcfee6/877a5ca9b7d34cd9b49f75e48e860ce6 [2018-10-27 06:12:10,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:12:10,958 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 06:12:10,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:12:10,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:12:10,963 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:12:10,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:12:10" (1/1) ... [2018-10-27 06:12:10,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d8d5e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:10, skipping insertion in model container [2018-10-27 06:12:10,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:12:10" (1/1) ... [2018-10-27 06:12:10,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:12:11,032 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:12:11,482 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:12:11,489 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:12:11,616 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:12:11,633 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:12:11,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:11 WrapperNode [2018-10-27 06:12:11,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:12:11,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:12:11,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:12:11,635 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:12:11,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:11" (1/1) ... [2018-10-27 06:12:11,665 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:11" (1/1) ... [2018-10-27 06:12:11,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:12:11,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:12:11,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:12:11,821 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:12:11,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:11" (1/1) ... [2018-10-27 06:12:11,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:11" (1/1) ... [2018-10-27 06:12:11,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:11" (1/1) ... [2018-10-27 06:12:11,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:11" (1/1) ... [2018-10-27 06:12:11,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:11" (1/1) ... [2018-10-27 06:12:11,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:11" (1/1) ... [2018-10-27 06:12:11,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:11" (1/1) ... [2018-10-27 06:12:11,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:12:11,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:12:11,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:12:11,947 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:12:11,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 06:12:12,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 06:12:12,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 06:12:12,033 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 06:12:12,033 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 06:12:12,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:12:12,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:12:12,034 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 06:12:12,034 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 06:12:15,561 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:12:15,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:15 BoogieIcfgContainer [2018-10-27 06:12:15,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:12:15,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 06:12:15,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 06:12:15,566 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 06:12:15,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 06:12:10" (1/3) ... [2018-10-27 06:12:15,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 06:12:15, skipping insertion in model container [2018-10-27 06:12:15,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:11" (2/3) ... [2018-10-27 06:12:15,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 06:12:15, skipping insertion in model container [2018-10-27 06:12:15,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:15" (3/3) ... [2018-10-27 06:12:15,570 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label14_true-unreach-call_false-termination.c [2018-10-27 06:12:15,579 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 06:12:15,587 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 06:12:15,604 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 06:12:15,641 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 06:12:15,642 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 06:12:15,642 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 06:12:15,642 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:12:15,642 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:12:15,642 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 06:12:15,643 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:12:15,643 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 06:12:15,677 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-27 06:12:15,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-27 06:12:15,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:15,696 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] [2018-10-27 06:12:15,699 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:15,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:15,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1648799080, now seen corresponding path program 1 times [2018-10-27 06:12:15,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:15,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:15,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:15,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:15,759 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:16,380 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 06:12:16,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:16,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:16,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:12:16,536 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:12:16,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 06:12:16,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:16,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:12:16,562 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-27 06:12:18,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:18,054 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-10-27 06:12:18,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:12:18,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-10-27 06:12:18,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:18,075 INFO L225 Difference]: With dead ends: 621 [2018-10-27 06:12:18,075 INFO L226 Difference]: Without dead ends: 382 [2018-10-27 06:12:18,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:12:18,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-27 06:12:18,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-27 06:12:18,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-27 06:12:18,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-10-27 06:12:18,158 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 124 [2018-10-27 06:12:18,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:18,159 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-10-27 06:12:18,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 06:12:18,159 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-10-27 06:12:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-27 06:12:18,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:18,166 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] [2018-10-27 06:12:18,166 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:18,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:18,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1971063541, now seen corresponding path program 1 times [2018-10-27 06:12:18,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:18,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:18,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:18,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:18,169 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:18,750 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-27 06:12:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:18,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:18,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:12:18,873 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:12:18,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:12:18,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:12:18,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:12:18,876 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-10-27 06:12:20,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:20,461 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-10-27 06:12:20,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:12:20,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2018-10-27 06:12:20,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:20,467 INFO L225 Difference]: With dead ends: 903 [2018-10-27 06:12:20,467 INFO L226 Difference]: Without dead ends: 381 [2018-10-27 06:12:20,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:12:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-27 06:12:20,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-27 06:12:20,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-27 06:12:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-10-27 06:12:20,510 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 133 [2018-10-27 06:12:20,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:20,510 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-10-27 06:12:20,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:12:20,510 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-10-27 06:12:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-27 06:12:20,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:20,518 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] [2018-10-27 06:12:20,518 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:20,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:20,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1740193815, now seen corresponding path program 1 times [2018-10-27 06:12:20,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:20,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:20,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:20,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:20,522 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:20,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:20,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:20,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:12:20,985 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:12:20,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:12:20,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:12:20,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:12:20,987 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-10-27 06:12:22,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:22,693 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-10-27 06:12:22,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:12:22,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2018-10-27 06:12:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:22,697 INFO L225 Difference]: With dead ends: 901 [2018-10-27 06:12:22,697 INFO L226 Difference]: Without dead ends: 380 [2018-10-27 06:12:22,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:12:22,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-27 06:12:22,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-27 06:12:22,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-27 06:12:22,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-10-27 06:12:22,719 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 139 [2018-10-27 06:12:22,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:22,719 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-10-27 06:12:22,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:12:22,720 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-10-27 06:12:22,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-27 06:12:22,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:22,722 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] [2018-10-27 06:12:22,723 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:22,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:22,723 INFO L82 PathProgramCache]: Analyzing trace with hash -295510606, now seen corresponding path program 1 times [2018-10-27 06:12:22,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:22,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:22,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:22,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:22,725 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:22,947 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 06:12:23,243 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:23,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:23,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 06:12:23,244 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:12:23,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 06:12:23,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:12:23,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:12:23,246 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-10-27 06:12:26,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:26,279 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-10-27 06:12:26,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:12:26,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2018-10-27 06:12:26,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:26,285 INFO L225 Difference]: With dead ends: 1193 [2018-10-27 06:12:26,285 INFO L226 Difference]: Without dead ends: 819 [2018-10-27 06:12:26,287 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-27 06:12:26,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-27 06:12:26,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-10-27 06:12:26,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-10-27 06:12:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-10-27 06:12:26,324 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 147 [2018-10-27 06:12:26,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:26,325 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-10-27 06:12:26,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 06:12:26,325 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-10-27 06:12:26,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-27 06:12:26,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:26,329 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] [2018-10-27 06:12:26,329 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:26,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:26,330 INFO L82 PathProgramCache]: Analyzing trace with hash -431421266, now seen corresponding path program 1 times [2018-10-27 06:12:26,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:26,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:26,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:26,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:26,331 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:26,724 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-27 06:12:26,963 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 06:12:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:27,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:27,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:12:27,039 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:12:27,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:12:27,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:12:27,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:12:27,041 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-10-27 06:12:28,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:28,350 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-10-27 06:12:28,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:12:28,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2018-10-27 06:12:28,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:28,364 INFO L225 Difference]: With dead ends: 1753 [2018-10-27 06:12:28,364 INFO L226 Difference]: Without dead ends: 804 [2018-10-27 06:12:28,368 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-27 06:12:28,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-27 06:12:28,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-10-27 06:12:28,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-10-27 06:12:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-10-27 06:12:28,402 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 149 [2018-10-27 06:12:28,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:28,402 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-10-27 06:12:28,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:12:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-10-27 06:12:28,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-27 06:12:28,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:28,407 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] [2018-10-27 06:12:28,407 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:28,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:28,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1643086762, now seen corresponding path program 1 times [2018-10-27 06:12:28,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:28,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:28,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:28,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:28,409 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:28,734 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:28,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:28,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:12:28,735 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:12:28,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:12:28,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:12:28,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:12:28,736 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-10-27 06:12:30,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:30,327 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-10-27 06:12:30,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:12:30,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2018-10-27 06:12:30,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:30,334 INFO L225 Difference]: With dead ends: 1747 [2018-10-27 06:12:30,335 INFO L226 Difference]: Without dead ends: 801 [2018-10-27 06:12:30,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:12:30,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-27 06:12:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-10-27 06:12:30,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-10-27 06:12:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-10-27 06:12:30,374 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 151 [2018-10-27 06:12:30,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:30,375 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-10-27 06:12:30,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:12:30,375 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-10-27 06:12:30,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-27 06:12:30,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:30,381 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] [2018-10-27 06:12:30,381 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:30,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:30,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1909626462, now seen corresponding path program 1 times [2018-10-27 06:12:30,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:30,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:30,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:30,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:30,386 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:30,568 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 06:12:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:30,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:12:30,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 06:12:30,625 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:12:30,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 06:12:30,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:12:30,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:12:30,626 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-10-27 06:12:31,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:31,776 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-10-27 06:12:31,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:12:31,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2018-10-27 06:12:31,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:31,786 INFO L225 Difference]: With dead ends: 2381 [2018-10-27 06:12:31,786 INFO L226 Difference]: Without dead ends: 1586 [2018-10-27 06:12:31,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:12:31,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-10-27 06:12:31,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-10-27 06:12:31,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-10-27 06:12:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-10-27 06:12:31,840 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 155 [2018-10-27 06:12:31,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:31,840 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-10-27 06:12:31,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 06:12:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-10-27 06:12:31,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-27 06:12:31,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:31,848 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] [2018-10-27 06:12:31,848 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:31,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:31,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1663549744, now seen corresponding path program 1 times [2018-10-27 06:12:31,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:31,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:31,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:31,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:31,850 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:32,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:32,197 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:12:32,198 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-10-27 06:12:32,200 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], [663], [665], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 06:12:32,266 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:12:32,266 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:12:33,226 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:12:33,228 INFO L272 AbstractInterpreter]: Visited 128 different actions 250 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-27 06:12:33,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:33,277 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:12:33,874 INFO L227 lantSequenceWeakener]: Weakened 187 states. On average, predicates are now at 82.64% of their original sizes. [2018-10-27 06:12:33,874 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:12:34,460 INFO L415 sIntCurrentIteration]: We unified 189 AI predicates to 189 [2018-10-27 06:12:34,460 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:12:34,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:12:34,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-27 06:12:34,461 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:12:34,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 06:12:34,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:12:34,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:12:34,463 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 10 states. [2018-10-27 06:12:46,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:46,175 INFO L93 Difference]: Finished difference Result 3925 states and 5567 transitions. [2018-10-27 06:12:46,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 06:12:46,175 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 190 [2018-10-27 06:12:46,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:46,187 INFO L225 Difference]: With dead ends: 3925 [2018-10-27 06:12:46,187 INFO L226 Difference]: Without dead ends: 2373 [2018-10-27 06:12:46,193 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 199 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-10-27 06:12:46,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2018-10-27 06:12:46,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2302. [2018-10-27 06:12:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2302 states. [2018-10-27 06:12:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 3078 transitions. [2018-10-27 06:12:46,252 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 3078 transitions. Word has length 190 [2018-10-27 06:12:46,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:46,252 INFO L481 AbstractCegarLoop]: Abstraction has 2302 states and 3078 transitions. [2018-10-27 06:12:46,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 06:12:46,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 3078 transitions. [2018-10-27 06:12:46,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-27 06:12:46,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:46,261 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] [2018-10-27 06:12:46,261 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:46,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:46,262 INFO L82 PathProgramCache]: Analyzing trace with hash 2065239331, now seen corresponding path program 1 times [2018-10-27 06:12:46,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:46,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:46,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:46,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:46,263 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:46,496 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 06:12:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:46,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:46,575 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:12:46,575 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2018-10-27 06:12:46,576 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], [663], [665], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 06:12:46,582 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:12:46,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:12:46,885 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 06:12:46,885 INFO L272 AbstractInterpreter]: Visited 130 different actions 386 times. Merged at 8 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 06:12:46,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:46,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 06:12:46,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:46,893 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:12:46,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:46,904 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 06:12:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:47,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:47,393 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 06:12:47,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:12:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 100 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 06:12:47,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 06:12:47,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 16 [2018-10-27 06:12:47,886 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 06:12:47,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 06:12:47,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 06:12:47,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-10-27 06:12:47,888 INFO L87 Difference]: Start difference. First operand 2302 states and 3078 transitions. Second operand 14 states. [2018-10-27 06:12:53,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:53,299 INFO L93 Difference]: Finished difference Result 7743 states and 10793 transitions. [2018-10-27 06:12:53,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 06:12:53,303 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 195 [2018-10-27 06:12:53,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:53,319 INFO L225 Difference]: With dead ends: 7743 [2018-10-27 06:12:53,320 INFO L226 Difference]: Without dead ends: 3458 [2018-10-27 06:12:53,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 402 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2018-10-27 06:12:53,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3458 states. [2018-10-27 06:12:53,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3458 to 3412. [2018-10-27 06:12:53,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3412 states. [2018-10-27 06:12:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3412 states to 3412 states and 4022 transitions. [2018-10-27 06:12:53,419 INFO L78 Accepts]: Start accepts. Automaton has 3412 states and 4022 transitions. Word has length 195 [2018-10-27 06:12:53,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:53,419 INFO L481 AbstractCegarLoop]: Abstraction has 3412 states and 4022 transitions. [2018-10-27 06:12:53,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 06:12:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3412 states and 4022 transitions. [2018-10-27 06:12:53,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-27 06:12:53,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:12:53,429 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] [2018-10-27 06:12:53,429 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:12:53,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:53,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1880112569, now seen corresponding path program 1 times [2018-10-27 06:12:53,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:12:53,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:53,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:53,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:53,431 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:12:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:12:53,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:53,684 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:12:53,685 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-10-27 06:12:53,685 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], [663], [665], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-27 06:12:53,691 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:12:53,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:12:54,151 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 06:12:54,151 INFO L272 AbstractInterpreter]: Visited 129 different actions 381 times. Merged at 7 different actions 18 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 06:12:54,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:54,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 06:12:54,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:12:54,192 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:12:54,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:54,209 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 06:12:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:12:54,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:12:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 06:12:54,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:12:54,717 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 06:12:54,755 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:12:54,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2018-10-27 06:12:54,756 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:12:54,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 06:12:54,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:12:54,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:12:54,758 INFO L87 Difference]: Start difference. First operand 3412 states and 4022 transitions. Second operand 3 states. [2018-10-27 06:12:56,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:12:56,349 INFO L93 Difference]: Finished difference Result 6490 states and 7719 transitions. [2018-10-27 06:12:56,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:12:56,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-10-27 06:12:56,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:12:56,351 INFO L225 Difference]: With dead ends: 6490 [2018-10-27 06:12:56,351 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 06:12:56,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:12:56,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 06:12:56,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 06:12:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 06:12:56,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 06:12:56,366 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2018-10-27 06:12:56,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:12:56,366 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:12:56,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 06:12:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:12:56,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 06:12:56,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 06:12:56,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:56,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:56,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:56,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:56,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:56,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:56,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:56,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:56,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:56,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:56,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:56,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:12:57,013 WARN L179 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2018-10-27 06:12:58,345 WARN L179 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 160 DAG size of output: 80 [2018-10-27 06:12:58,635 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2018-10-27 06:12:59,066 WARN L179 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 49 [2018-10-27 06:12:59,069 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 06:12:59,070 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a17~0)| ~a17~0) (= |old(~a25~0)| ~a25~0) (= ~a28~0 |old(~a28~0)|)) [2018-10-27 06:12:59,070 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 06:12:59,070 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,070 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,071 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,071 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,071 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,071 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-27 06:12:59,071 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-27 06:12:59,071 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-27 06:12:59,071 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-27 06:12:59,071 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-27 06:12:59,072 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-27 06:12:59,072 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-27 06:12:59,072 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-27 06:12:59,072 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-27 06:12:59,072 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-27 06:12:59,072 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-27 06:12:59,072 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-27 06:12:59,072 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-27 06:12:59,072 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,073 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,073 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,073 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,073 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-27 06:12:59,073 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,073 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-27 06:12:59,073 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-27 06:12:59,074 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-27 06:12:59,074 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-27 06:12:59,074 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-27 06:12:59,074 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-27 06:12:59,074 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-27 06:12:59,074 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-27 06:12:59,074 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-27 06:12:59,074 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-27 06:12:59,074 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-27 06:12:59,075 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-27 06:12:59,075 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-27 06:12:59,075 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-27 06:12:59,075 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-27 06:12:59,075 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,075 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,075 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,075 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,076 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,076 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-27 06:12:59,076 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-27 06:12:59,076 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-27 06:12:59,076 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-27 06:12:59,076 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-27 06:12:59,076 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-27 06:12:59,076 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-27 06:12:59,077 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-27 06:12:59,077 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-27 06:12:59,077 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-27 06:12:59,077 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-27 06:12:59,077 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,077 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,077 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,077 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,078 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,078 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-27 06:12:59,078 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-27 06:12:59,078 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-27 06:12:59,078 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-27 06:12:59,078 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-27 06:12:59,078 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-27 06:12:59,078 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-27 06:12:59,079 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-27 06:12:59,079 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-27 06:12:59,079 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 523) no Hoare annotation was computed. [2018-10-27 06:12:59,079 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-27 06:12:59,079 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-27 06:12:59,079 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-27 06:12:59,079 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-27 06:12:59,079 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,080 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,080 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,080 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,080 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,080 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-27 06:12:59,080 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-27 06:12:59,080 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-27 06:12:59,080 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-27 06:12:59,081 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-27 06:12:59,081 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-27 06:12:59,081 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-27 06:12:59,081 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-27 06:12:59,081 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-27 06:12:59,081 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-27 06:12:59,081 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-27 06:12:59,081 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-27 06:12:59,082 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-27 06:12:59,082 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-27 06:12:59,082 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-27 06:12:59,082 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-27 06:12:59,082 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,082 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,082 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,082 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,082 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-27 06:12:59,083 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,083 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-27 06:12:59,083 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,083 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-27 06:12:59,083 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-27 06:12:59,083 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-27 06:12:59,083 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,083 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,084 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-27 06:12:59,084 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-27 06:12:59,084 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-27 06:12:59,084 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-27 06:12:59,084 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-27 06:12:59,084 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-27 06:12:59,084 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-27 06:12:59,085 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-27 06:12:59,085 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-27 06:12:59,085 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-27 06:12:59,085 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-27 06:12:59,085 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,085 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,085 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,085 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,085 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,086 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,086 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-27 06:12:59,086 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-27 06:12:59,086 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-27 06:12:59,086 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-27 06:12:59,086 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-27 06:12:59,086 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-27 06:12:59,086 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-27 06:12:59,087 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-27 06:12:59,087 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-27 06:12:59,087 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-27 06:12:59,087 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-27 06:12:59,087 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,087 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,087 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,087 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,087 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,088 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,088 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-27 06:12:59,088 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-27 06:12:59,088 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-27 06:12:59,088 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-27 06:12:59,088 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-27 06:12:59,088 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-27 06:12:59,088 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-27 06:12:59,089 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-27 06:12:59,089 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-27 06:12:59,089 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-27 06:12:59,089 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-27 06:12:59,089 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-27 06:12:59,089 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-27 06:12:59,089 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-27 06:12:59,089 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,090 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,090 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,091 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse9 (= 1 |old(~a19~0)|)) (.cse1 (= 1 |old(~a11~0)|)) (.cse15 (= 1 |old(~a25~0)|)) (.cse12 (= 1 ~a11~0)) (.cse13 (= 1 ~a19~0)) (.cse23 (= |old(~a17~0)| ~a17~0)) (.cse24 (= |old(~a25~0)| ~a25~0)) (.cse25 (= ~a28~0 |old(~a28~0)|))) (let ((.cse3 (and .cse23 .cse24 .cse25)) (.cse7 (and .cse23 .cse25 (= ~a25~0 1))) (.cse4 (< 7 |old(~a17~0)|)) (.cse10 (not (= 7 |old(~a28~0)|))) (.cse21 (and .cse12 .cse13)) (.cse5 (not .cse15)) (.cse6 (= 9 |old(~a28~0)|)) (.cse14 (not .cse1)) (.cse8 (not (= |old(~a17~0)| 8))) (.cse22 (not (= ~a11~0 1))) (.cse0 (not (= 1 ~a21~0))) (.cse17 (not .cse9)) (.cse18 (= 0 |old(~a28~0)|)) (.cse2 (= 8 |old(~a28~0)|)) (.cse19 (not (= 0 |old(~a11~0)|))) (.cse11 (not (= 8 |old(~a17~0)|))) (.cse20 (= |calculate_output_#in~input| 0)) (.cse16 (and (= ~a11~0 0) (= ~a19~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse5 .cse2 .cse6 .cse7 .cse8) (or .cse9 .cse0 .cse10 .cse11 (and .cse12 (not .cse13)) .cse14 .cse15) (or .cse0 .cse2 .cse6 .cse3 .cse4) (or .cse0 .cse2 .cse3 .cse8 .cse15) (or .cse16 .cse0 .cse5 .cse17 .cse18 .cse19 .cse11 .cse20) (or .cse0 .cse5 .cse2 .cse7 .cse4) (or .cse21 .cse0 (not (= 10 |old(~a28~0)|)) .cse5 .cse17 .cse11 .cse14) (or .cse0 .cse1 .cse2 .cse22 .cse4) (or .cse0 .cse10 .cse5 .cse17 .cse14 .cse21 (not (= 7 |old(~a17~0)|))) (or .cse0 .cse5 .cse17 .cse11 (and .cse12 (= 1 ~a25~0) (= 9 ~a28~0) (= 8 ~a17~0) .cse13) (not .cse6) .cse14) (or .cse0 .cse1 .cse8 (and .cse23 .cse24 .cse25 .cse22)) (or .cse0 .cse17 .cse18 .cse2 .cse19 .cse11 .cse20 .cse16)))) [2018-10-27 06:12:59,091 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,092 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,092 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,092 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-27 06:12:59,092 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-27 06:12:59,092 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-27 06:12:59,092 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-27 06:12:59,092 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-27 06:12:59,092 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-27 06:12:59,093 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-27 06:12:59,093 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-27 06:12:59,093 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-27 06:12:59,093 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-27 06:12:59,093 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-27 06:12:59,093 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-27 06:12:59,093 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-27 06:12:59,093 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,093 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,094 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,094 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,094 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,094 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,094 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-27 06:12:59,094 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-27 06:12:59,094 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-27 06:12:59,094 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-27 06:12:59,095 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-27 06:12:59,095 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-27 06:12:59,095 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-27 06:12:59,095 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-27 06:12:59,095 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-27 06:12:59,095 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-27 06:12:59,095 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-27 06:12:59,095 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-27 06:12:59,095 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-27 06:12:59,096 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-27 06:12:59,096 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-27 06:12:59,096 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-27 06:12:59,096 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,096 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,096 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,096 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,096 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-27 06:12:59,097 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-27 06:12:59,097 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-27 06:12:59,097 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-27 06:12:59,097 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-27 06:12:59,097 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-27 06:12:59,097 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-27 06:12:59,097 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-27 06:12:59,097 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-27 06:12:59,097 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-27 06:12:59,098 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-27 06:12:59,099 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-27 06:12:59,099 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-27 06:12:59,099 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-27 06:12:59,099 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-27 06:12:59,099 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-27 06:12:59,099 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-27 06:12:59,100 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-27 06:12:59,100 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-27 06:12:59,100 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-27 06:12:59,100 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 06:12:59,100 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 7) (= ~a21~0 1)) [2018-10-27 06:12:59,100 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 06:12:59,100 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 06:12:59,100 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 1 |old(~a19~0)|)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a19~0 1) (= ~a28~0 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (not (= 8 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|))) [2018-10-27 06:12:59,101 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-27 06:12:59,101 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1)) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse1 (not (= ~a11~0 1))) (.cse2 (<= ~a17~0 7)) (.cse3 (not (= ~a28~0 8))) (.cse5 (not (= ~a28~0 9)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and .cse0 .cse1) (and (= 9 ~a28~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= 0 |old(~a25~0)|)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse5) (not (= 1 |old(~a19~0)|)) (and (not .cse4) .cse0 .cse3) (not (= 8 |old(~a17~0)|)) (and .cse2 .cse3 .cse1) (and .cse2 .cse3 .cse5))) [2018-10-27 06:12:59,101 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-27 06:12:59,101 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-27 06:12:59,101 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse4 (= ~a25~0 1)) (.cse0 (= |old(~a17~0)| ~a17~0)) (.cse1 (not (= ~a11~0 1))) (.cse2 (<= ~a17~0 7)) (.cse3 (not (= ~a28~0 8))) (.cse5 (not (= ~a28~0 9)))) (or (not (= 1 ~a21~0)) (not (= 7 |old(~a28~0)|)) (not (= 0 |old(~a11~0)|)) (and .cse0 .cse1) (and (= 9 ~a28~0) (= 8 ~a17~0) (= 1 ~a19~0)) (not (= 0 |old(~a25~0)|)) (and .cse2 .cse3 .cse4) (and .cse0 .cse3 .cse5) (not (= 1 |old(~a19~0)|)) (and (not .cse4) .cse0 .cse3) (not (= 8 |old(~a17~0)|)) (and .cse2 .cse3 .cse1) (and .cse2 .cse3 .cse5))) [2018-10-27 06:12:59,101 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-27 06:12:59,101 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-27 06:12:59,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 06:12:59 BoogieIcfgContainer [2018-10-27 06:12:59,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 06:12:59,130 INFO L168 Benchmark]: Toolchain (without parser) took 48173.08 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-27 06:12:59,133 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 06:12:59,133 INFO L168 Benchmark]: CACSL2BoogieTranslator took 675.55 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-27 06:12:59,137 INFO L168 Benchmark]: Boogie Procedure Inliner took 185.83 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 685.8 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -763.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-27 06:12:59,141 INFO L168 Benchmark]: Boogie Preprocessor took 124.77 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2018-10-27 06:12:59,142 INFO L168 Benchmark]: RCFGBuilder took 3615.54 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 108.4 MB). Peak memory consumption was 108.4 MB. Max. memory is 7.1 GB. [2018-10-27 06:12:59,142 INFO L168 Benchmark]: TraceAbstraction took 43566.18 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 472.9 MB). Free memory was 2.0 GB in the beginning and 2.4 GB in the end (delta: -401.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-10-27 06:12:59,154 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 675.55 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 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 185.83 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 685.8 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -763.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.77 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3615.54 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 108.4 MB). Peak memory consumption was 108.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43566.18 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 472.9 MB). Free memory was 2.0 GB in the beginning and 2.4 GB in the end (delta: -401.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 523]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((!(1 == a21) || !(7 == \old(a28))) || !(0 == \old(a11))) || (\old(a17) == a17 && !(a11 == 1))) || ((9 == a28 && 8 == a17) && 1 == a19)) || !(0 == \old(a25))) || ((a17 <= 7 && !(a28 == 8)) && a25 == 1)) || ((\old(a17) == a17 && !(a28 == 8)) && !(a28 == 9))) || !(1 == \old(a19))) || ((!(a25 == 1) && \old(a17) == a17) && !(a28 == 8))) || !(8 == \old(a17))) || ((a17 <= 7 && !(a28 == 8)) && !(a11 == 1))) || ((a17 <= 7 && !(a28 == 8)) && !(a28 == 9)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 43.4s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 30.7s AutomataDifference, 0.0s DeadEndRemovalTime, 2.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1383 SDtfs, 7652 SDslu, 1337 SDs, 0 SdLazy, 9216 SolverSat, 1903 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1117 GetRequests, 1027 SyntacticMatches, 8 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3412occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.9s AbstIntTime, 3 AbstIntIterations, 1 AbstIntStrong, 0.9975777692397675 AbsIntWeakeningRatio, 0.1746031746031746 AbsIntAvgWeakeningVarsNumRemoved, 26.33862433862434 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 157 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 102 PreInvPairs, 174 NumberOfFragments, 654 HoareAnnotationTreeSize, 102 FomulaSimplifications, 2530 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2758 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 2000 NumberOfCodeBlocks, 2000 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2392 ConstructedInterpolants, 0 QuantifiedInterpolants, 1917727 SizeOfPredicates, 1 NumberOfNonLiveVariables, 968 ConjunctsInSsa, 11 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...