java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label34_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 07:09:00,119 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 07:09:00,124 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 07:09:00,141 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 07:09:00,141 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 07:09:00,143 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 07:09:00,145 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 07:09:00,147 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 07:09:00,150 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 07:09:00,152 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 07:09:00,153 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 07:09:00,154 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 07:09:00,157 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 07:09:00,158 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 07:09:00,159 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 07:09:00,163 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 07:09:00,164 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 07:09:00,174 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 07:09:00,176 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 07:09:00,181 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 07:09:00,182 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 07:09:00,183 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 07:09:00,186 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 07:09:00,186 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 07:09:00,186 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 07:09:00,190 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 07:09:00,191 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 07:09:00,191 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 07:09:00,193 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 07:09:00,194 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 07:09:00,196 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 07:09:00,197 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 07:09:00,197 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 07:09:00,199 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 07:09:00,200 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 07:09:00,201 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 07:09:00,201 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 07:09:00,228 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 07:09:00,228 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 07:09:00,229 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 07:09:00,229 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 07:09:00,229 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 07:09:00,230 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 07:09:00,230 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 07:09:00,230 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 07:09:00,231 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 07:09:00,231 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 07:09:00,231 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 07:09:00,231 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 07:09:00,231 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 07:09:00,232 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 07:09:00,233 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 07:09:00,234 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 07:09:00,234 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 07:09:00,234 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 07:09:00,234 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 07:09:00,235 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 07:09:00,235 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 07:09:00,235 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 07:09:00,235 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 07:09:00,237 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 07:09:00,237 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 07:09:00,237 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 07:09:00,238 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 07:09:00,238 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 07:09:00,238 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 07:09:00,238 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 07:09:00,238 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 07:09:00,239 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 07:09:00,239 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 07:09:00,239 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 07:09:00,239 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 07:09:00,239 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 07:09:00,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 07:09:00,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 07:09:00,322 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 07:09:00,323 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 07:09:00,324 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 07:09:00,325 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label34_true-unreach-call_false-termination.c [2018-11-07 07:09:00,390 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45d79230/8f0c8b741e6243af844e7bd27cafb49d/FLAGfdfad12f1 [2018-11-07 07:09:00,983 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 07:09:00,984 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label34_true-unreach-call_false-termination.c [2018-11-07 07:09:00,995 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45d79230/8f0c8b741e6243af844e7bd27cafb49d/FLAGfdfad12f1 [2018-11-07 07:09:01,010 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45d79230/8f0c8b741e6243af844e7bd27cafb49d [2018-11-07 07:09:01,021 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 07:09:01,023 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 07:09:01,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 07:09:01,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 07:09:01,027 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 07:09:01,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:09:01" (1/1) ... [2018-11-07 07:09:01,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@511c7d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:01, skipping insertion in model container [2018-11-07 07:09:01,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:09:01" (1/1) ... [2018-11-07 07:09:01,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 07:09:01,098 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 07:09:01,543 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:09:01,549 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 07:09:01,638 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 07:09:01,656 INFO L193 MainTranslator]: Completed translation [2018-11-07 07:09:01,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:01 WrapperNode [2018-11-07 07:09:01,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 07:09:01,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 07:09:01,658 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 07:09:01,658 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 07:09:01,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:01" (1/1) ... [2018-11-07 07:09:01,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:01" (1/1) ... [2018-11-07 07:09:01,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 07:09:01,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 07:09:01,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 07:09:01,781 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 07:09:01,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:01" (1/1) ... [2018-11-07 07:09:01,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:01" (1/1) ... [2018-11-07 07:09:01,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:01" (1/1) ... [2018-11-07 07:09:01,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:01" (1/1) ... [2018-11-07 07:09:01,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:01" (1/1) ... [2018-11-07 07:09:01,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:01" (1/1) ... [2018-11-07 07:09:01,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:01" (1/1) ... [2018-11-07 07:09:01,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 07:09:01,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 07:09:01,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 07:09:01,907 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 07:09:01,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 07:09:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 07:09:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 07:09:01,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 07:09:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 07:09:01,992 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 07:09:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 07:09:01,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 07:09:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 07:09:01,993 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 07:09:05,171 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 07:09:05,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:09:05 BoogieIcfgContainer [2018-11-07 07:09:05,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 07:09:05,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 07:09:05,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 07:09:05,177 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 07:09:05,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:09:01" (1/3) ... [2018-11-07 07:09:05,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74941f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:09:05, skipping insertion in model container [2018-11-07 07:09:05,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:09:01" (2/3) ... [2018-11-07 07:09:05,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74941f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:09:05, skipping insertion in model container [2018-11-07 07:09:05,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:09:05" (3/3) ... [2018-11-07 07:09:05,181 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label34_true-unreach-call_false-termination.c [2018-11-07 07:09:05,192 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 07:09:05,202 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 07:09:05,220 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 07:09:05,260 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 07:09:05,260 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 07:09:05,260 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 07:09:05,260 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 07:09:05,260 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 07:09:05,261 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 07:09:05,261 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 07:09:05,261 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 07:09:05,290 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 07:09:05,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-07 07:09:05,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:05,307 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] [2018-11-07 07:09:05,309 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:05,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:05,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2048669081, now seen corresponding path program 1 times [2018-11-07 07:09:05,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:05,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:05,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:05,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:05,386 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:06,028 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:09:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:09:06,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:09:06,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:09:06,179 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:06,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:09:06,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:09:06,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:09:06,207 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 07:09:07,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:07,813 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2018-11-07 07:09:07,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:09:07,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2018-11-07 07:09:07,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:07,837 INFO L225 Difference]: With dead ends: 618 [2018-11-07 07:09:07,837 INFO L226 Difference]: Without dead ends: 379 [2018-11-07 07:09:07,845 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:09:07,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-07 07:09:07,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-11-07 07:09:07,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-07 07:09:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 621 transitions. [2018-11-07 07:09:07,936 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 621 transitions. Word has length 105 [2018-11-07 07:09:07,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:07,937 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 621 transitions. [2018-11-07 07:09:07,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:09:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 621 transitions. [2018-11-07 07:09:07,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-07 07:09:07,945 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:07,946 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:09:07,946 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:07,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:07,947 INFO L82 PathProgramCache]: Analyzing trace with hash -926147150, now seen corresponding path program 1 times [2018-11-07 07:09:07,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:07,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:07,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:07,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:07,949 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:08,226 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-11-07 07:09:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:09:08,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:09:08,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:09:08,356 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:08,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:09:08,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:09:08,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:09:08,358 INFO L87 Difference]: Start difference. First operand 379 states and 621 transitions. Second operand 6 states. [2018-11-07 07:09:10,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:10,560 INFO L93 Difference]: Finished difference Result 1231 states and 2094 transitions. [2018-11-07 07:09:10,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 07:09:10,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-11-07 07:09:10,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:10,579 INFO L225 Difference]: With dead ends: 1231 [2018-11-07 07:09:10,580 INFO L226 Difference]: Without dead ends: 858 [2018-11-07 07:09:10,588 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:09:10,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-11-07 07:09:10,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 821. [2018-11-07 07:09:10,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-11-07 07:09:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1290 transitions. [2018-11-07 07:09:10,653 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1290 transitions. Word has length 121 [2018-11-07 07:09:10,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:10,654 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 1290 transitions. [2018-11-07 07:09:10,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:09:10,654 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1290 transitions. [2018-11-07 07:09:10,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-07 07:09:10,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:10,669 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] [2018-11-07 07:09:10,670 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:10,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:10,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1688257955, now seen corresponding path program 1 times [2018-11-07 07:09:10,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:10,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:10,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:10,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:10,673 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 07:09:10,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:09:10,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 07:09:10,910 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:10,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:09:10,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:09:10,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:09:10,912 INFO L87 Difference]: Start difference. First operand 821 states and 1290 transitions. Second operand 6 states. [2018-11-07 07:09:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:14,940 INFO L93 Difference]: Finished difference Result 2553 states and 4218 transitions. [2018-11-07 07:09:14,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:09:14,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-11-07 07:09:14,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:14,965 INFO L225 Difference]: With dead ends: 2553 [2018-11-07 07:09:14,965 INFO L226 Difference]: Without dead ends: 1738 [2018-11-07 07:09:14,972 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:09:14,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-11-07 07:09:15,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1680. [2018-11-07 07:09:15,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2018-11-07 07:09:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2538 transitions. [2018-11-07 07:09:15,064 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2538 transitions. Word has length 128 [2018-11-07 07:09:15,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:15,064 INFO L480 AbstractCegarLoop]: Abstraction has 1680 states and 2538 transitions. [2018-11-07 07:09:15,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:09:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2538 transitions. [2018-11-07 07:09:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-07 07:09:15,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:15,072 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:09:15,072 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:15,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:15,073 INFO L82 PathProgramCache]: Analyzing trace with hash -690130107, now seen corresponding path program 1 times [2018-11-07 07:09:15,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:15,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:15,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:15,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:15,076 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:15,277 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 07:09:15,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:09:15,277 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:09:15,278 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2018-11-07 07:09:15,280 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:09:15,335 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:09:15,335 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:09:15,922 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:09:15,923 INFO L272 AbstractInterpreter]: Visited 106 different actions 106 times. Never merged. Never widened. Never found a fixpoint. Largest state had 38 variables. [2018-11-07 07:09:15,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:15,948 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:09:16,359 INFO L227 lantSequenceWeakener]: Weakened 121 states. On average, predicates are now at 80.75% of their original sizes. [2018-11-07 07:09:16,359 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:09:16,458 INFO L415 sIntCurrentIteration]: We unified 129 AI predicates to 129 [2018-11-07 07:09:16,459 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:09:16,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:09:16,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-07 07:09:16,460 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:16,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 07:09:16,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 07:09:16,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 07:09:16,461 INFO L87 Difference]: Start difference. First operand 1680 states and 2538 transitions. Second operand 6 states. [2018-11-07 07:09:26,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:26,327 INFO L93 Difference]: Finished difference Result 3502 states and 5277 transitions. [2018-11-07 07:09:26,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 07:09:26,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2018-11-07 07:09:26,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:26,338 INFO L225 Difference]: With dead ends: 3502 [2018-11-07 07:09:26,338 INFO L226 Difference]: Without dead ends: 1828 [2018-11-07 07:09:26,344 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 07:09:26,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2018-11-07 07:09:26,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1825. [2018-11-07 07:09:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1825 states. [2018-11-07 07:09:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2690 transitions. [2018-11-07 07:09:26,400 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2690 transitions. Word has length 130 [2018-11-07 07:09:26,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:26,401 INFO L480 AbstractCegarLoop]: Abstraction has 1825 states and 2690 transitions. [2018-11-07 07:09:26,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 07:09:26,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2690 transitions. [2018-11-07 07:09:26,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 07:09:26,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:26,407 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 07:09:26,407 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:26,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:26,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1874144486, now seen corresponding path program 1 times [2018-11-07 07:09:26,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:26,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:26,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:26,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:26,410 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:26,804 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 07:09:26,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:09:26,805 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:09:26,805 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2018-11-07 07:09:26,806 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:09:26,811 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:09:26,812 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:09:27,153 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:09:27,153 INFO L272 AbstractInterpreter]: Visited 110 different actions 329 times. Merged at 7 different actions 21 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 07:09:27,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:27,198 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:09:27,410 INFO L227 lantSequenceWeakener]: Weakened 137 states. On average, predicates are now at 84.4% of their original sizes. [2018-11-07 07:09:27,411 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:09:28,033 INFO L415 sIntCurrentIteration]: We unified 139 AI predicates to 139 [2018-11-07 07:09:28,033 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:09:28,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:09:28,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2018-11-07 07:09:28,034 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:28,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 07:09:28,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 07:09:28,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:09:28,035 INFO L87 Difference]: Start difference. First operand 1825 states and 2690 transitions. Second operand 9 states. [2018-11-07 07:09:36,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:36,162 INFO L93 Difference]: Finished difference Result 4527 states and 6707 transitions. [2018-11-07 07:09:36,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 07:09:36,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 140 [2018-11-07 07:09:36,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:36,177 INFO L225 Difference]: With dead ends: 4527 [2018-11-07 07:09:36,177 INFO L226 Difference]: Without dead ends: 2708 [2018-11-07 07:09:36,184 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 147 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-11-07 07:09:36,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2018-11-07 07:09:36,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2631. [2018-11-07 07:09:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2631 states. [2018-11-07 07:09:36,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3698 transitions. [2018-11-07 07:09:36,260 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3698 transitions. Word has length 140 [2018-11-07 07:09:36,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:36,260 INFO L480 AbstractCegarLoop]: Abstraction has 2631 states and 3698 transitions. [2018-11-07 07:09:36,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 07:09:36,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3698 transitions. [2018-11-07 07:09:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-07 07:09:36,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:36,267 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 07:09:36,267 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:36,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:36,268 INFO L82 PathProgramCache]: Analyzing trace with hash 506322742, now seen corresponding path program 1 times [2018-11-07 07:09:36,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:36,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:36,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:36,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:36,269 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 07:09:36,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 07:09:36,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 07:09:36,523 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:36,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 07:09:36,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 07:09:36,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:09:36,524 INFO L87 Difference]: Start difference. First operand 2631 states and 3698 transitions. Second operand 3 states. [2018-11-07 07:09:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:37,257 INFO L93 Difference]: Finished difference Result 6470 states and 9537 transitions. [2018-11-07 07:09:37,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 07:09:37,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2018-11-07 07:09:37,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:37,272 INFO L225 Difference]: With dead ends: 6470 [2018-11-07 07:09:37,272 INFO L226 Difference]: Without dead ends: 2633 [2018-11-07 07:09:37,288 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 07:09:37,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2018-11-07 07:09:37,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2572. [2018-11-07 07:09:37,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2572 states. [2018-11-07 07:09:37,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 3335 transitions. [2018-11-07 07:09:37,351 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 3335 transitions. Word has length 142 [2018-11-07 07:09:37,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:37,352 INFO L480 AbstractCegarLoop]: Abstraction has 2572 states and 3335 transitions. [2018-11-07 07:09:37,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 07:09:37,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 3335 transitions. [2018-11-07 07:09:37,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-07 07:09:37,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:37,360 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 07:09:37,360 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:37,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:37,360 INFO L82 PathProgramCache]: Analyzing trace with hash -919197045, now seen corresponding path program 1 times [2018-11-07 07:09:37,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:37,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:37,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:37,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:37,362 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:37,534 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 66 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-07 07:09:37,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:09:37,535 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:09:37,535 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2018-11-07 07:09:37,535 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:09:37,540 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:09:37,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:09:37,786 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:09:37,787 INFO L272 AbstractInterpreter]: Visited 110 different actions 328 times. Merged at 8 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 07:09:37,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:37,791 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:09:38,000 INFO L227 lantSequenceWeakener]: Weakened 164 states. On average, predicates are now at 84.26% of their original sizes. [2018-11-07 07:09:38,000 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:09:38,152 INFO L415 sIntCurrentIteration]: We unified 166 AI predicates to 166 [2018-11-07 07:09:38,152 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:09:38,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:09:38,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-11-07 07:09:38,153 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:38,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 07:09:38,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 07:09:38,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-07 07:09:38,154 INFO L87 Difference]: Start difference. First operand 2572 states and 3335 transitions. Second operand 9 states. [2018-11-07 07:09:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:43,520 INFO L93 Difference]: Finished difference Result 5329 states and 6804 transitions. [2018-11-07 07:09:43,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 07:09:43,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2018-11-07 07:09:43,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:43,531 INFO L225 Difference]: With dead ends: 5329 [2018-11-07 07:09:43,532 INFO L226 Difference]: Without dead ends: 2763 [2018-11-07 07:09:43,538 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 174 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-11-07 07:09:43,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2018-11-07 07:09:43,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2696. [2018-11-07 07:09:43,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2018-11-07 07:09:43,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 3276 transitions. [2018-11-07 07:09:43,605 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 3276 transitions. Word has length 167 [2018-11-07 07:09:43,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:43,605 INFO L480 AbstractCegarLoop]: Abstraction has 2696 states and 3276 transitions. [2018-11-07 07:09:43,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 07:09:43,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 3276 transitions. [2018-11-07 07:09:43,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-07 07:09:43,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:43,614 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 3, 3, 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-11-07 07:09:43,614 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:43,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:43,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1394719238, now seen corresponding path program 1 times [2018-11-07 07:09:43,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:43,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:43,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:43,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:43,616 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:43,852 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:09:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 107 proven. 35 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-07 07:09:43,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:09:43,889 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:09:43,889 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-11-07 07:09:43,890 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:09:43,893 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:09:43,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:09:44,199 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:09:44,199 INFO L272 AbstractInterpreter]: Visited 113 different actions 441 times. Merged at 8 different actions 29 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 07:09:44,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:44,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:09:44,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:09:44,206 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 07:09:44,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:44,216 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:09:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:44,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:09:44,617 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-07 07:09:44,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:09:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 107 proven. 35 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-07 07:09:45,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:09:45,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-11-07 07:09:45,461 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:09:45,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 07:09:45,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 07:09:45,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:09:45,462 INFO L87 Difference]: Start difference. First operand 2696 states and 3276 transitions. Second operand 9 states. [2018-11-07 07:09:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:49,271 INFO L93 Difference]: Finished difference Result 6420 states and 7932 transitions. [2018-11-07 07:09:49,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 07:09:49,272 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 210 [2018-11-07 07:09:49,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:49,287 INFO L225 Difference]: With dead ends: 6420 [2018-11-07 07:09:49,287 INFO L226 Difference]: Without dead ends: 3730 [2018-11-07 07:09:49,297 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 419 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-11-07 07:09:49,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3730 states. [2018-11-07 07:09:49,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3730 to 3683. [2018-11-07 07:09:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3683 states. [2018-11-07 07:09:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3683 states to 3683 states and 4477 transitions. [2018-11-07 07:09:49,395 INFO L78 Accepts]: Start accepts. Automaton has 3683 states and 4477 transitions. Word has length 210 [2018-11-07 07:09:49,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:49,396 INFO L480 AbstractCegarLoop]: Abstraction has 3683 states and 4477 transitions. [2018-11-07 07:09:49,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 07:09:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 3683 states and 4477 transitions. [2018-11-07 07:09:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-07 07:09:49,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:49,409 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 07:09:49,409 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:49,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:49,410 INFO L82 PathProgramCache]: Analyzing trace with hash -735902478, now seen corresponding path program 1 times [2018-11-07 07:09:49,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:49,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:49,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:49,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:49,412 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 115 proven. 35 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 07:09:49,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:09:49,717 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:09:49,718 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 215 with the following transitions: [2018-11-07 07:09:49,718 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], [127], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:09:49,723 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:09:49,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:09:50,227 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 07:09:50,227 INFO L272 AbstractInterpreter]: Visited 113 different actions 441 times. Merged at 8 different actions 29 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 07:09:50,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:50,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 07:09:50,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:09:50,264 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 07:09:50,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:50,281 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 07:09:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:50,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 07:09:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 07:09:50,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 07:09:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 07:09:50,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 07:09:50,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-07 07:09:50,691 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 07:09:50,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 07:09:50,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 07:09:50,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-07 07:09:50,692 INFO L87 Difference]: Start difference. First operand 3683 states and 4477 transitions. Second operand 9 states. [2018-11-07 07:09:54,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:09:54,552 INFO L93 Difference]: Finished difference Result 8089 states and 9990 transitions. [2018-11-07 07:09:54,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 07:09:54,552 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 214 [2018-11-07 07:09:54,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:09:54,563 INFO L225 Difference]: With dead ends: 8089 [2018-11-07 07:09:54,563 INFO L226 Difference]: Without dead ends: 2568 [2018-11-07 07:09:54,576 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 446 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 07:09:54,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2018-11-07 07:09:54,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2475. [2018-11-07 07:09:54,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2018-11-07 07:09:54,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 2841 transitions. [2018-11-07 07:09:54,645 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 2841 transitions. Word has length 214 [2018-11-07 07:09:54,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:09:54,645 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 2841 transitions. [2018-11-07 07:09:54,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 07:09:54,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 2841 transitions. [2018-11-07 07:09:54,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-07 07:09:54,653 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:09:54,654 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 07:09:54,654 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:09:54,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:54,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1941426456, now seen corresponding path program 1 times [2018-11-07 07:09:54,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:09:54,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:54,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:09:54,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:09:54,656 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:09:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:09:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 105 proven. 54 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 07:09:55,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:09:55,279 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:09:55,279 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 216 with the following transitions: [2018-11-07 07:09:55,279 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], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [225], [228], [232], [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], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:09:55,281 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:09:55,282 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:09:55,479 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:09:55,479 INFO L272 AbstractInterpreter]: Visited 110 different actions 322 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 07:09:55,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:09:55,517 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:09:55,821 INFO L227 lantSequenceWeakener]: Weakened 210 states. On average, predicates are now at 84.12% of their original sizes. [2018-11-07 07:09:55,821 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:09:56,215 INFO L415 sIntCurrentIteration]: We unified 214 AI predicates to 214 [2018-11-07 07:09:56,215 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:09:56,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:09:56,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2018-11-07 07:09:56,215 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:09:56,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 07:09:56,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 07:09:56,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-07 07:09:56,218 INFO L87 Difference]: Start difference. First operand 2475 states and 2841 transitions. Second operand 10 states. [2018-11-07 07:10:01,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:10:01,219 INFO L93 Difference]: Finished difference Result 5798 states and 6682 transitions. [2018-11-07 07:10:01,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 07:10:01,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 215 [2018-11-07 07:10:01,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:10:01,230 INFO L225 Difference]: With dead ends: 5798 [2018-11-07 07:10:01,230 INFO L226 Difference]: Without dead ends: 3637 [2018-11-07 07:10:01,235 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 225 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2018-11-07 07:10:01,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3637 states. [2018-11-07 07:10:01,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3637 to 3449. [2018-11-07 07:10:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3449 states. [2018-11-07 07:10:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 3931 transitions. [2018-11-07 07:10:01,312 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 3931 transitions. Word has length 215 [2018-11-07 07:10:01,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:10:01,312 INFO L480 AbstractCegarLoop]: Abstraction has 3449 states and 3931 transitions. [2018-11-07 07:10:01,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 07:10:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 3931 transitions. [2018-11-07 07:10:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-11-07 07:10:01,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:10:01,325 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 07:10:01,325 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:10:01,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:01,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1096328394, now seen corresponding path program 1 times [2018-11-07 07:10:01,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:10:01,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:01,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:10:01,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:01,327 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:10:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:10:01,605 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:10:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 226 proven. 123 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-07 07:10:01,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:10:01,982 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:10:01,982 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 330 with the following transitions: [2018-11-07 07:10:01,982 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [56], [59], [63], [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], [202], [205], [209], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [351], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:10:01,985 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:10:01,985 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:10:02,163 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:10:02,163 INFO L272 AbstractInterpreter]: Visited 114 different actions 330 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 07:10:02,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:02,171 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:10:02,466 INFO L227 lantSequenceWeakener]: Weakened 322 states. On average, predicates are now at 82.37% of their original sizes. [2018-11-07 07:10:02,466 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:10:02,583 INFO L415 sIntCurrentIteration]: We unified 328 AI predicates to 328 [2018-11-07 07:10:02,583 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:10:02,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:10:02,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-11-07 07:10:02,584 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:10:02,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 07:10:02,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 07:10:02,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-07 07:10:02,586 INFO L87 Difference]: Start difference. First operand 3449 states and 3931 transitions. Second operand 12 states. [2018-11-07 07:10:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:10:10,531 INFO L93 Difference]: Finished difference Result 8332 states and 9596 transitions. [2018-11-07 07:10:10,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-07 07:10:10,531 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 329 [2018-11-07 07:10:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:10:10,548 INFO L225 Difference]: With dead ends: 8332 [2018-11-07 07:10:10,549 INFO L226 Difference]: Without dead ends: 4678 [2018-11-07 07:10:10,557 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 345 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2018-11-07 07:10:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4678 states. [2018-11-07 07:10:10,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4678 to 4332. [2018-11-07 07:10:10,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4332 states. [2018-11-07 07:10:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4332 states to 4332 states and 4903 transitions. [2018-11-07 07:10:10,685 INFO L78 Accepts]: Start accepts. Automaton has 4332 states and 4903 transitions. Word has length 329 [2018-11-07 07:10:10,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:10:10,686 INFO L480 AbstractCegarLoop]: Abstraction has 4332 states and 4903 transitions. [2018-11-07 07:10:10,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 07:10:10,686 INFO L276 IsEmpty]: Start isEmpty. Operand 4332 states and 4903 transitions. [2018-11-07 07:10:10,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-11-07 07:10:10,702 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 07:10:10,702 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 07:10:10,703 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 07:10:10,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:10,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1644311275, now seen corresponding path program 1 times [2018-11-07 07:10:10,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 07:10:10,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:10,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 07:10:10,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 07:10:10,704 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 07:10:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 07:10:11,222 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 07:10:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 248 proven. 42 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-11-07 07:10:11,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 07:10:11,465 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 07:10:11,466 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 347 with the following transitions: [2018-11-07 07:10:11,466 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [21], [22], [25], [26], [30], [34], [38], [42], [53], [56], [59], [63], [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], [202], [205], [209], [210], [214], [218], [222], [225], [228], [232], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [351], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [511], [513], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-11-07 07:10:11,469 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 07:10:11,469 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 07:10:11,856 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 07:10:11,857 INFO L272 AbstractInterpreter]: Visited 116 different actions 464 times. Merged at 9 different actions 39 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 07:10:11,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 07:10:11,900 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 07:10:12,272 INFO L227 lantSequenceWeakener]: Weakened 214 states. On average, predicates are now at 87.11% of their original sizes. [2018-11-07 07:10:12,273 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 07:10:12,647 INFO L415 sIntCurrentIteration]: We unified 345 AI predicates to 345 [2018-11-07 07:10:12,647 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 07:10:12,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 07:10:12,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [5] total 22 [2018-11-07 07:10:12,648 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 07:10:12,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 07:10:12,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 07:10:12,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2018-11-07 07:10:12,649 INFO L87 Difference]: Start difference. First operand 4332 states and 4903 transitions. Second operand 19 states. [2018-11-07 07:10:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 07:10:20,986 INFO L93 Difference]: Finished difference Result 7487 states and 8489 transitions. [2018-11-07 07:10:20,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-07 07:10:20,986 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 346 [2018-11-07 07:10:20,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 07:10:20,986 INFO L225 Difference]: With dead ends: 7487 [2018-11-07 07:10:20,986 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 07:10:21,000 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 365 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=315, Invalid=1167, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 07:10:21,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 07:10:21,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 07:10:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 07:10:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 07:10:21,002 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 346 [2018-11-07 07:10:21,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 07:10:21,002 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 07:10:21,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 07:10:21,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 07:10:21,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 07:10:21,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 07:10:21,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:21,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:21,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:21,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:21,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:21,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:21,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:21,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:21,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:21,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:21,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:21,489 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 161 [2018-11-07 07:10:21,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:21,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:21,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:21,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:21,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:21,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:21,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:21,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:21,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 07:10:21,852 WARN L179 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 200 [2018-11-07 07:10:22,359 WARN L179 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-11-07 07:10:22,745 WARN L179 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 77 [2018-11-07 07:10:26,671 WARN L179 SmtUtils]: Spent 3.91 s on a formula simplification. DAG size of input: 265 DAG size of output: 86 [2018-11-07 07:10:27,645 WARN L179 SmtUtils]: Spent 950.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 104 [2018-11-07 07:10:29,073 WARN L179 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 213 DAG size of output: 115 [2018-11-07 07:10:29,076 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:10:29,077 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a17~0 |old(~a17~0)|) (= |old(~a28~0)| ~a28~0) (= |old(~a19~0)| ~a19~0) (= ~a11~0 |old(~a11~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-11-07 07:10:29,077 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:10:29,077 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,077 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,077 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,077 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,077 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,078 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 07:10:29,078 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 07:10:29,078 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 07:10:29,078 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 07:10:29,078 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 07:10:29,078 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 07:10:29,078 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 07:10:29,078 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 07:10:29,078 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 07:10:29,079 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 07:10:29,079 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 07:10:29,079 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 07:10:29,079 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 07:10:29,079 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,079 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,079 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,079 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,079 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,080 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 07:10:29,080 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 07:10:29,080 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 07:10:29,080 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 07:10:29,080 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 07:10:29,080 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 07:10:29,080 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 07:10:29,080 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 07:10:29,080 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 07:10:29,081 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 07:10:29,081 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 07:10:29,081 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 07:10:29,081 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 07:10:29,081 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 07:10:29,081 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 07:10:29,081 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 07:10:29,081 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,081 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,082 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,082 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,082 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,082 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 07:10:29,082 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 07:10:29,082 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 07:10:29,083 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 07:10:29,083 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 07:10:29,083 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 07:10:29,083 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 07:10:29,083 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 07:10:29,083 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 07:10:29,083 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 07:10:29,083 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 07:10:29,083 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,084 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,084 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,084 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,084 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,084 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 07:10:29,084 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 466) no Hoare annotation was computed. [2018-11-07 07:10:29,084 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 07:10:29,084 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 07:10:29,085 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 07:10:29,085 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 07:10:29,085 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 07:10:29,085 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 07:10:29,085 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 07:10:29,085 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 07:10:29,085 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 07:10:29,085 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 07:10:29,086 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 07:10:29,086 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 07:10:29,086 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,086 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,086 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,086 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,086 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,086 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 07:10:29,086 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 07:10:29,087 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 07:10:29,087 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 07:10:29,087 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 07:10:29,087 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 07:10:29,087 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 07:10:29,087 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 07:10:29,087 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 07:10:29,087 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 07:10:29,087 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 07:10:29,087 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 07:10:29,087 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 07:10:29,087 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 07:10:29,088 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 07:10:29,088 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 07:10:29,088 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,088 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,088 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,088 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,088 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,088 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 07:10:29,088 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 07:10:29,088 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,088 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 07:10:29,088 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 07:10:29,088 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 07:10:29,089 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,089 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,089 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 07:10:29,089 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 07:10:29,089 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 07:10:29,089 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 07:10:29,089 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 07:10:29,089 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 07:10:29,089 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 07:10:29,089 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 07:10:29,089 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 07:10:29,089 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 07:10:29,089 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 07:10:29,089 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,090 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,090 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,090 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,090 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,090 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,090 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 07:10:29,090 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 07:10:29,090 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 07:10:29,090 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 07:10:29,090 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 07:10:29,090 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 07:10:29,090 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 07:10:29,090 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 07:10:29,090 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 07:10:29,091 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 07:10:29,091 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 07:10:29,091 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,091 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,091 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,091 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,091 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,091 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,091 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 07:10:29,091 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 07:10:29,092 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 07:10:29,092 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 07:10:29,092 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 07:10:29,092 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 07:10:29,092 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 07:10:29,092 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 07:10:29,092 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 07:10:29,092 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 07:10:29,092 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 07:10:29,092 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 07:10:29,093 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 07:10:29,093 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 07:10:29,093 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,093 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,093 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,093 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,094 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse8 (= 1 |old(~a25~0)|))) (let ((.cse2 (<= ~a17~0 |old(~a17~0)|)) (.cse13 (= ~a19~0 1)) (.cse14 (not (= ~a17~0 0))) (.cse23 (not .cse8)) (.cse9 (not (= 1 ~a21~0))) (.cse11 (not (= 1 |old(~a19~0)|))) (.cse12 (= 0 |old(~a28~0)|)) (.cse22 (not (= 0 |old(~a11~0)|))) (.cse3 (= |old(~a28~0)| ~a28~0)) (.cse4 (= |old(~a19~0)| ~a19~0)) (.cse25 (= ~a11~0 0)) (.cse16 (= ~a17~0 8)) (.cse6 (= ~a25~0 |old(~a25~0)|))) (let ((.cse5 (= 1 ~a11~0)) (.cse17 (= |old(~a25~0)| ~a25~0)) (.cse21 (and .cse3 .cse4 .cse25 .cse16 .cse6)) (.cse1 (not (= 1 |old(~a11~0)|))) (.cse0 (< 10 |old(~a28~0)|)) (.cse24 (and (or .cse9 (not (= 10 |old(~a28~0)|)) .cse23 .cse22 (not (= 0 |old(~a19~0)|))) (or .cse9 .cse11 .cse12 .cse22))) (.cse18 (not (= 8 |old(~a17~0)|))) (.cse10 (= 0 |old(~a17~0)|)) (.cse20 (= |old(~a11~0)| |old(~a19~0)|)) (.cse15 (= |calculate_output_#in~input| 0)) (.cse19 (and .cse2 (= ~a11~0 |old(~a11~0)|) .cse3 .cse13 .cse14 .cse6)) (.cse7 (< 7 |old(~a17~0)|))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 .cse8) (or .cse9 .cse10 .cse11 .cse12 (and .cse2 .cse3 .cse5 .cse13 .cse14 .cse6) .cse15 .cse1 .cse8 .cse7) (or (and (not (= ~a28~0 0)) .cse5 .cse16 .cse17 .cse13) .cse9 .cse11 .cse12 .cse18 .cse15 .cse1) (or .cse0 .cse9 .cse10 .cse11 .cse12 .cse15 .cse7 .cse19) (or (and .cse4 .cse5 .cse17) .cse20 .cse1) (or .cse21 (and (not (= 7 |old(~a28~0)|)) (not (= 8 |old(~a28~0)|))) (or .cse9 .cse22 .cse18 .cse8) .cse15) (or .cse23 .cse21 .cse24 .cse18 .cse15) (or (= 7 |old(~a17~0)|) (not (= ~a17~0 7)) .cse20 .cse1) (or (or .cse0 .cse24 .cse8) (and .cse3 .cse25 .cse13 .cse16 .cse6) .cse18 .cse15) (or .cse9 .cse10 .cse23 .cse11 .cse12 .cse20 .cse15 .cse19 .cse7))))) [2018-11-07 07:10:29,094 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,094 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,094 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 07:10:29,094 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 07:10:29,094 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 07:10:29,094 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 07:10:29,094 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 07:10:29,095 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 07:10:29,095 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 07:10:29,095 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 07:10:29,095 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 07:10:29,095 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 07:10:29,095 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 07:10:29,095 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 07:10:29,095 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 07:10:29,095 INFO L425 ceAbstractionStarter]: For program point L591(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,095 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,096 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,096 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,096 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,096 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,096 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 07:10:29,096 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 07:10:29,096 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 07:10:29,096 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 07:10:29,096 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 07:10:29,097 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 07:10:29,097 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 07:10:29,097 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 07:10:29,097 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 07:10:29,097 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 07:10:29,097 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 07:10:29,097 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 07:10:29,097 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 07:10:29,097 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 07:10:29,097 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 07:10:29,097 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 07:10:29,097 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,097 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,098 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,098 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,098 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 07:10:29,098 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 07:10:29,098 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 07:10:29,098 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 07:10:29,098 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 07:10:29,098 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 07:10:29,098 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 07:10:29,098 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 07:10:29,098 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 07:10:29,098 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 07:10:29,098 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 07:10:29,098 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 07:10:29,098 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 07:10:29,099 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 07:10:29,099 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 07:10:29,099 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 07:10:29,099 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 07:10:29,099 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 07:10:29,099 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 07:10:29,099 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 07:10:29,099 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 07:10:29,099 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-11-07 07:10:29,099 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 07:10:29,099 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 07:10:29,100 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (and (= ~a19~0 1) (= ~a25~0 |old(~a25~0)|) (= ~a11~0 |old(~a11~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8)) (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 07:10:29,100 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 07:10:29,100 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse6 (not (= ~a28~0 0))) (.cse11 (= ~a19~0 1)) (.cse0 (= ~a11~0 0)) (.cse4 (= ~a17~0 8)) (.cse12 (= ~a25~0 1))) (let ((.cse5 (<= ~a17~0 7)) (.cse3 (not .cse12)) (.cse7 (= 1 ~a11~0)) (.cse2 (= ~a28~0 7)) (.cse9 (= 1 ~a25~0)) (.cse1 (not (= main_~input~0 0))) (.cse8 (<= ~a28~0 10)) (.cse10 (or (and .cse0 .cse6 .cse4 .cse11) (and (= ~a28~0 10) (= ~a19~0 0) .cse0 .cse4 .cse12)))) (or (and .cse0 .cse1 (or .cse2 (= ~a28~0 8)) .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 (not (= ~a17~0 0))) (and .cse6 .cse7 .cse4) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse7 (not (= ~a19~0 ~a11~0))) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse5 .cse3 .cse7 .cse8) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (and (and .cse9 .cse10) .cse2) (not (= 23 ~w~0)) (and .cse11 .cse2 (and .cse0 (= ~a25~0 |old(~a25~0)|)) (not (= main_~output~0 0)) .cse4) (not (= |old(~a28~0)| 7)) (and .cse0 .cse1 (and (and .cse6 .cse4 .cse11) .cse9)) (not (= ~a~0 1)) (and .cse1 .cse8 .cse10) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0))))) [2018-11-07 07:10:29,100 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 07:10:29,100 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 07:10:29,100 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse4 (<= ~a17~0 7)) (.cse2 (not (= ~a25~0 1))) (.cse8 (= 1 ~a25~0)) (.cse6 (= 1 ~a11~0)) (.cse1 (not (= main_~input~0 0))) (.cse7 (<= ~a28~0 10)) (.cse0 (= ~a11~0 0)) (.cse5 (not (= ~a28~0 0))) (.cse3 (= ~a17~0 8)) (.cse9 (= ~a19~0 1))) (or (and .cse0 .cse1 (or (= ~a28~0 7) (= ~a28~0 8)) .cse2 .cse3) (and .cse1 .cse4 .cse5 .cse6 .cse7 (not (= ~a17~0 0))) (not (= ~a21~0 1)) (not (= ~y~0 25)) (and .cse6 (not (= ~a19~0 ~a11~0))) (and .cse0 .cse1 .cse5 .cse8 .cse9 .cse3) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= |old(~a11~0)| 0)) (and .cse4 .cse2 .cse6 .cse7) (not (= ~z~0 26)) (and .cse0 .cse1 (and (= ~a28~0 10) (= ~a19~0 0)) .cse8 .cse3) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (and .cse1 .cse5 .cse6 .cse3) (and .cse1 .cse7 .cse0 .cse5 .cse3 .cse9) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0)))) [2018-11-07 07:10:29,100 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 07:10:29,100 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 07:10:29,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:10:29 BoogieIcfgContainer [2018-11-07 07:10:29,118 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 07:10:29,119 INFO L168 Benchmark]: Toolchain (without parser) took 88097.32 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -693.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-11-07 07:10:29,120 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 07:10:29,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 633.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2018-11-07 07:10:29,122 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -821.2 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2018-11-07 07:10:29,123 INFO L168 Benchmark]: Boogie Preprocessor took 126.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2018-11-07 07:10:29,124 INFO L168 Benchmark]: RCFGBuilder took 3265.66 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.9 MB). Peak memory consumption was 104.9 MB. Max. memory is 7.1 GB. [2018-11-07 07:10:29,124 INFO L168 Benchmark]: TraceAbstraction took 83944.97 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -14.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-11-07 07:10:29,129 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 633.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 122.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -821.2 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.04 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3265.66 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.9 MB). Peak memory consumption was 104.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 83944.97 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -14.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 466]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((a11 == 0 && !(input == 0)) && (a28 == 7 || a28 == 8)) && !(a25 == 1)) && a17 == 8) || ((((a17 <= 7 && !(a28 == 0)) && 1 == a11) && a28 <= 10) && !(a17 == 0))) || ((!(a28 == 0) && 1 == a11) && a17 == 8)) || !(a21 == 1)) || !(y == 25)) || (1 == a11 && !(a19 == a11))) || !(1 == \old(a19))) || !(x == 24)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || !(\old(a11) == 0)) || (((a17 <= 7 && !(a25 == 1)) && 1 == a11) && a28 <= 10)) || !(z == 26)) || !(0 == \old(a25))) || !(3 == c)) || ((1 == a25 && ((((a11 == 0 && !(a28 == 0)) && a17 == 8) && a19 == 1) || ((((a28 == 10 && a19 == 0) && a11 == 0) && a17 == 8) && a25 == 1))) && a28 == 7)) || !(23 == w)) || ((((a19 == 1 && a28 == 7) && a11 == 0 && a25 == \old(a25)) && !(output == 0)) && a17 == 8)) || !(\old(a28) == 7)) || ((a11 == 0 && !(input == 0)) && ((!(a28 == 0) && a17 == 8) && a19 == 1) && 1 == a25)) || !(a == 1)) || ((!(input == 0) && a28 <= 10) && ((((a11 == 0 && !(a28 == 0)) && a17 == 8) && a19 == 1) || ((((a28 == 10 && a19 == 0) && a11 == 0) && a17 == 8) && a25 == 1)))) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 83.8s OverallTime, 12 OverallIterations, 7 TraceHistogramMax, 61.1s AutomataDifference, 0.0s DeadEndRemovalTime, 8.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1609 SDtfs, 9658 SDslu, 2542 SDs, 0 SdLazy, 13728 SolverSat, 2404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.9s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 2329 GetRequests, 2142 SyntacticMatches, 7 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4332occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.0s AbstIntTime, 8 AbstIntIterations, 6 AbstIntStrong, 0.9964967424536741 AbsIntWeakeningRatio, 0.21120363361090083 AbsIntAvgWeakeningVarsNumRemoved, 24.69871309613929 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 977 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 195 PreInvPairs, 280 NumberOfFragments, 1062 HoareAnnotationTreeSize, 195 FomulaSimplifications, 28890 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 15376 FormulaSimplificationTreeSizeReductionInter, 7.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 2671 NumberOfCodeBlocks, 2671 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3079 ConstructedInterpolants, 0 QuantifiedInterpolants, 1274067 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1030 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 2012/2376 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...