java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:03:44,227 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:03:44,229 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:03:44,244 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:03:44,245 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:03:44,246 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:03:44,250 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:03:44,252 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:03:44,254 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:03:44,262 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:03:44,264 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:03:44,264 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:03:44,265 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:03:44,268 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:03:44,270 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:03:44,271 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:03:44,272 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:03:44,275 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:03:44,277 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:03:44,282 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:03:44,284 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:03:44,285 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:03:44,288 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:03:44,288 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:03:44,288 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:03:44,291 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:03:44,291 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:03:44,292 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:03:44,293 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:03:44,295 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:03:44,295 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:03:44,296 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:03:44,296 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:03:44,296 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:03:44,297 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:03:44,299 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:03:44,299 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:03:44,318 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:03:44,318 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:03:44,319 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:03:44,319 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:03:44,319 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:03:44,319 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:03:44,320 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:03:44,320 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:03:44,320 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:03:44,320 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:03:44,320 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:03:44,320 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:03:44,321 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:03:44,321 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:03:44,321 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:03:44,322 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:03:44,322 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:03:44,322 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:03:44,322 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:03:44,322 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:03:44,323 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:03:44,323 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:03:44,323 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:03:44,323 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:03:44,323 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:03:44,323 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:03:44,324 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:03:44,324 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:03:44,324 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:03:44,324 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:03:44,324 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:03:44,325 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:03:44,325 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:03:44,325 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:03:44,325 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:03:44,325 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:03:44,369 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:03:44,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:03:44,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:03:44,386 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:03:44,387 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:03:44,387 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c [2018-10-25 00:03:44,449 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/fef2fe075/ccdb2325f3d44fe6998ef9089b9355a4/FLAG26c6b29f3 [2018-10-25 00:03:45,031 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:03:45,033 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label53_true-unreach-call_false-termination.c [2018-10-25 00:03:45,052 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/fef2fe075/ccdb2325f3d44fe6998ef9089b9355a4/FLAG26c6b29f3 [2018-10-25 00:03:45,070 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/fef2fe075/ccdb2325f3d44fe6998ef9089b9355a4 [2018-10-25 00:03:45,082 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:03:45,084 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:03:45,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:03:45,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:03:45,092 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:03:45,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:03:45" (1/1) ... [2018-10-25 00:03:45,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@662db0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:45, skipping insertion in model container [2018-10-25 00:03:45,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:03:45" (1/1) ... [2018-10-25 00:03:45,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:03:45,176 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:03:45,651 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:03:45,657 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:03:45,787 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:03:45,812 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:03:45,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:45 WrapperNode [2018-10-25 00:03:45,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:03:45,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:03:45,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:03:45,814 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:03:45,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:45" (1/1) ... [2018-10-25 00:03:45,859 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:45" (1/1) ... [2018-10-25 00:03:46,029 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:03:46,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:03:46,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:03:46,030 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:03:46,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:45" (1/1) ... [2018-10-25 00:03:46,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:45" (1/1) ... [2018-10-25 00:03:46,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:45" (1/1) ... [2018-10-25 00:03:46,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:45" (1/1) ... [2018-10-25 00:03:46,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:45" (1/1) ... [2018-10-25 00:03:46,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:45" (1/1) ... [2018-10-25 00:03:46,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:45" (1/1) ... [2018-10-25 00:03:46,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:03:46,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:03:46,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:03:46,141 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:03:46,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:03:46,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:03:46,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:03:46,217 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:03:46,217 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:03:46,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:03:46,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:03:46,218 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:03:46,218 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:03:49,375 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:03:49,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:03:49 BoogieIcfgContainer [2018-10-25 00:03:49,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:03:49,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:03:49,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:03:49,381 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:03:49,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:03:45" (1/3) ... [2018-10-25 00:03:49,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c09318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:03:49, skipping insertion in model container [2018-10-25 00:03:49,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:03:45" (2/3) ... [2018-10-25 00:03:49,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c09318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:03:49, skipping insertion in model container [2018-10-25 00:03:49,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:03:49" (3/3) ... [2018-10-25 00:03:49,385 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label53_true-unreach-call_false-termination.c [2018-10-25 00:03:49,396 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:03:49,404 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:03:49,423 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:03:49,460 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:03:49,461 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:03:49,461 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:03:49,461 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:03:49,461 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:03:49,462 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:03:49,462 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:03:49,462 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:03:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-25 00:03:49,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-25 00:03:49,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:49,509 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:49,511 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:49,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:49,517 INFO L82 PathProgramCache]: Analyzing trace with hash 311071925, now seen corresponding path program 1 times [2018-10-25 00:03:49,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:49,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:49,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:49,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:49,573 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:03:50,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:03:50,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:03:50,154 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:50,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:03:50,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:03:50,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:03:50,184 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-25 00:03:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:51,800 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-25 00:03:51,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:03:51,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-10-25 00:03:51,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:51,822 INFO L225 Difference]: With dead ends: 550 [2018-10-25 00:03:51,822 INFO L226 Difference]: Without dead ends: 340 [2018-10-25 00:03:51,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:03:51,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-25 00:03:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-25 00:03:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-25 00:03:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-10-25 00:03:51,909 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 121 [2018-10-25 00:03:51,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:51,910 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-10-25 00:03:51,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:03:51,911 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-10-25 00:03:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-25 00:03:51,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:51,917 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:51,918 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:51,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:51,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1224558518, now seen corresponding path program 1 times [2018-10-25 00:03:51,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:51,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:51,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:51,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:51,920 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:03:52,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:03:52,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:03:52,156 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:52,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:03:52,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:03:52,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:03:52,159 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-10-25 00:03:53,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:53,989 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-10-25 00:03:53,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:03:53,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2018-10-25 00:03:53,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:53,997 INFO L225 Difference]: With dead ends: 888 [2018-10-25 00:03:53,997 INFO L226 Difference]: Without dead ends: 554 [2018-10-25 00:03:54,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:03:54,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-25 00:03:54,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-10-25 00:03:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-25 00:03:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-10-25 00:03:54,044 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 132 [2018-10-25 00:03:54,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:54,045 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-10-25 00:03:54,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:03:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-10-25 00:03:54,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-25 00:03:54,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:54,051 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:54,052 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:54,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:54,052 INFO L82 PathProgramCache]: Analyzing trace with hash 408720354, now seen corresponding path program 1 times [2018-10-25 00:03:54,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:54,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:54,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:54,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:54,054 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:54,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:03:54,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:03:54,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:03:54,591 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:54,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:03:54,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:03:54,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:03:54,593 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-10-25 00:03:56,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:56,162 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-10-25 00:03:56,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:03:56,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2018-10-25 00:03:56,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:56,166 INFO L225 Difference]: With dead ends: 1210 [2018-10-25 00:03:56,167 INFO L226 Difference]: Without dead ends: 536 [2018-10-25 00:03:56,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:03:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-10-25 00:03:56,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-10-25 00:03:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-10-25 00:03:56,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-10-25 00:03:56,192 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 133 [2018-10-25 00:03:56,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:56,192 INFO L481 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-10-25 00:03:56,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:03:56,192 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-10-25 00:03:56,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-25 00:03:56,197 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:56,197 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:56,197 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:56,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:56,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1676803526, now seen corresponding path program 1 times [2018-10-25 00:03:56,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:56,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:56,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:56,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:56,199 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:56,553 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-10-25 00:03:56,862 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-10-25 00:03:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:03:56,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:03:56,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:03:56,962 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:56,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:03:56,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:03:56,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:03:56,963 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-10-25 00:03:59,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:03:59,329 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-10-25 00:03:59,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:03:59,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-10-25 00:03:59,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:03:59,333 INFO L225 Difference]: With dead ends: 1204 [2018-10-25 00:03:59,334 INFO L226 Difference]: Without dead ends: 535 [2018-10-25 00:03:59,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:03:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-10-25 00:03:59,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-10-25 00:03:59,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-10-25 00:03:59,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-10-25 00:03:59,354 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 134 [2018-10-25 00:03:59,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:03:59,354 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-10-25 00:03:59,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:03:59,355 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-10-25 00:03:59,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-25 00:03:59,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:03:59,358 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:03:59,358 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:03:59,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:03:59,359 INFO L82 PathProgramCache]: Analyzing trace with hash 468681710, now seen corresponding path program 1 times [2018-10-25 00:03:59,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:03:59,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:59,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:03:59,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:03:59,361 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:03:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:03:59,624 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:03:59,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:03:59,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:03:59,624 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:03:59,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:03:59,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:03:59,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:03:59,626 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-10-25 00:04:00,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:00,922 INFO L93 Difference]: Finished difference Result 1521 states and 2300 transitions. [2018-10-25 00:04:00,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:04:00,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-10-25 00:04:00,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:00,941 INFO L225 Difference]: With dead ends: 1521 [2018-10-25 00:04:00,941 INFO L226 Difference]: Without dead ends: 992 [2018-10-25 00:04:00,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:04:00,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-10-25 00:04:00,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2018-10-25 00:04:00,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-10-25 00:04:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1411 transitions. [2018-10-25 00:04:00,985 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1411 transitions. Word has length 139 [2018-10-25 00:04:00,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:00,985 INFO L481 AbstractCegarLoop]: Abstraction has 992 states and 1411 transitions. [2018-10-25 00:04:00,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:04:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1411 transitions. [2018-10-25 00:04:00,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-25 00:04:00,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:00,992 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:00,992 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:00,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:00,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1975800262, now seen corresponding path program 1 times [2018-10-25 00:04:00,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:00,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:00,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:00,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:00,994 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:01,152 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:01,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:01,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:04:01,152 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:01,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:04:01,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:04:01,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:04:01,153 INFO L87 Difference]: Start difference. First operand 992 states and 1411 transitions. Second operand 6 states. [2018-10-25 00:04:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:02,248 INFO L93 Difference]: Finished difference Result 2947 states and 4374 transitions. [2018-10-25 00:04:02,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:04:02,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2018-10-25 00:04:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:02,270 INFO L225 Difference]: With dead ends: 2947 [2018-10-25 00:04:02,270 INFO L226 Difference]: Without dead ends: 1961 [2018-10-25 00:04:02,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:04:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2018-10-25 00:04:02,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1928. [2018-10-25 00:04:02,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-10-25 00:04:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2554 transitions. [2018-10-25 00:04:02,351 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2554 transitions. Word has length 140 [2018-10-25 00:04:02,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:02,351 INFO L481 AbstractCegarLoop]: Abstraction has 1928 states and 2554 transitions. [2018-10-25 00:04:02,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:04:02,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2554 transitions. [2018-10-25 00:04:02,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-25 00:04:02,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:02,360 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:02,360 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:02,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:02,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1294574634, now seen corresponding path program 1 times [2018-10-25 00:04:02,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:02,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:02,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:02,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:02,362 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-25 00:04:02,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:02,629 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:04:02,630 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-10-25 00:04:02,633 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:04:02,686 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:04:02,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:04:03,371 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:04:03,373 INFO L272 AbstractInterpreter]: Visited 121 different actions 121 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-25 00:04:03,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:03,414 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:04:03,934 INFO L232 lantSequenceWeakener]: Weakened 142 states. On average, predicates are now at 80.49% of their original sizes. [2018-10-25 00:04:03,935 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:04:04,181 INFO L413 sIntCurrentIteration]: We have 147 unified AI predicates [2018-10-25 00:04:04,182 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:04:04,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:04:04,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-10-25 00:04:04,183 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:04,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:04:04,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:04:04,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:04:04,184 INFO L87 Difference]: Start difference. First operand 1928 states and 2554 transitions. Second operand 6 states. [2018-10-25 00:04:13,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:13,003 INFO L93 Difference]: Finished difference Result 3988 states and 5280 transitions. [2018-10-25 00:04:13,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-25 00:04:13,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-10-25 00:04:13,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:13,014 INFO L225 Difference]: With dead ends: 3988 [2018-10-25 00:04:13,014 INFO L226 Difference]: Without dead ends: 2066 [2018-10-25 00:04:13,020 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-25 00:04:13,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2018-10-25 00:04:13,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 2064. [2018-10-25 00:04:13,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2064 states. [2018-10-25 00:04:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2696 transitions. [2018-10-25 00:04:13,076 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2696 transitions. Word has length 148 [2018-10-25 00:04:13,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:13,076 INFO L481 AbstractCegarLoop]: Abstraction has 2064 states and 2696 transitions. [2018-10-25 00:04:13,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:04:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2696 transitions. [2018-10-25 00:04:13,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-25 00:04:13,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:13,084 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:13,085 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:13,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:13,085 INFO L82 PathProgramCache]: Analyzing trace with hash 430394681, now seen corresponding path program 1 times [2018-10-25 00:04:13,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:13,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:13,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:13,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:13,087 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:13,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:13,273 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:04:13,273 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2018-10-25 00:04:13,274 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:04:13,279 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:04:13,279 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:04:13,671 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:04:13,671 INFO L272 AbstractInterpreter]: Visited 125 different actions 244 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:04:13,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:13,710 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:04:14,390 INFO L232 lantSequenceWeakener]: Weakened 154 states. On average, predicates are now at 80.57% of their original sizes. [2018-10-25 00:04:14,391 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:04:14,967 INFO L413 sIntCurrentIteration]: We have 156 unified AI predicates [2018-10-25 00:04:14,967 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:04:14,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:04:14,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-25 00:04:14,968 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:14,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-25 00:04:14,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-25 00:04:14,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:04:14,969 INFO L87 Difference]: Start difference. First operand 2064 states and 2696 transitions. Second operand 10 states. [2018-10-25 00:04:23,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:23,685 INFO L93 Difference]: Finished difference Result 4127 states and 5425 transitions. [2018-10-25 00:04:23,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-25 00:04:23,686 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 157 [2018-10-25 00:04:23,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:23,696 INFO L225 Difference]: With dead ends: 4127 [2018-10-25 00:04:23,696 INFO L226 Difference]: Without dead ends: 2205 [2018-10-25 00:04:23,702 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 164 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:04:23,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2018-10-25 00:04:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2202. [2018-10-25 00:04:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2018-10-25 00:04:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 2844 transitions. [2018-10-25 00:04:23,760 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 2844 transitions. Word has length 157 [2018-10-25 00:04:23,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:23,760 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 2844 transitions. [2018-10-25 00:04:23,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-25 00:04:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 2844 transitions. [2018-10-25 00:04:23,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-25 00:04:23,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:23,770 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-25 00:04:23,770 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:23,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:23,770 INFO L82 PathProgramCache]: Analyzing trace with hash 949105357, now seen corresponding path program 1 times [2018-10-25 00:04:23,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:23,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:23,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:23,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:23,772 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 88 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:23,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:23,965 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:04:23,965 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 191 with the following transitions: [2018-10-25 00:04:23,965 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:04:23,970 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:04:23,970 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:04:24,306 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:04:24,306 INFO L272 AbstractInterpreter]: Visited 125 different actions 244 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-25 00:04:24,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:24,341 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:04:24,888 INFO L232 lantSequenceWeakener]: Weakened 132 states. On average, predicates are now at 80.84% of their original sizes. [2018-10-25 00:04:24,888 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:04:28,231 INFO L413 sIntCurrentIteration]: We have 189 unified AI predicates [2018-10-25 00:04:28,231 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:04:28,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:04:28,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-10-25 00:04:28,232 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:28,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:04:28,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:04:28,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:04:28,233 INFO L87 Difference]: Start difference. First operand 2202 states and 2844 transitions. Second operand 15 states. [2018-10-25 00:04:44,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:44,951 INFO L93 Difference]: Finished difference Result 4686 states and 6090 transitions. [2018-10-25 00:04:44,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:04:44,952 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 190 [2018-10-25 00:04:44,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:44,963 INFO L225 Difference]: With dead ends: 4686 [2018-10-25 00:04:44,963 INFO L226 Difference]: Without dead ends: 2764 [2018-10-25 00:04:44,969 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 196 GetRequests, 63 SyntacticMatches, 113 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-10-25 00:04:44,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2018-10-25 00:04:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2754. [2018-10-25 00:04:45,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2754 states. [2018-10-25 00:04:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2754 states to 2754 states and 3424 transitions. [2018-10-25 00:04:45,036 INFO L78 Accepts]: Start accepts. Automaton has 2754 states and 3424 transitions. Word has length 190 [2018-10-25 00:04:45,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:45,036 INFO L481 AbstractCegarLoop]: Abstraction has 2754 states and 3424 transitions. [2018-10-25 00:04:45,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:04:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2754 states and 3424 transitions. [2018-10-25 00:04:45,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-25 00:04:45,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:45,047 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-25 00:04:45,047 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:45,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:45,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1559476336, now seen corresponding path program 1 times [2018-10-25 00:04:45,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:45,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:45,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:45,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:45,049 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:45,510 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 75 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-25 00:04:45,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:45,511 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:04:45,511 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-10-25 00:04:45,512 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:04:45,516 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:04:45,516 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:04:46,029 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:04:46,029 INFO L272 AbstractInterpreter]: Visited 126 different actions 385 times. Merged at 8 different actions 29 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:04:46,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:46,036 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:04:47,187 INFO L232 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 82.5% of their original sizes. [2018-10-25 00:04:47,187 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:04:52,558 INFO L413 sIntCurrentIteration]: We have 198 unified AI predicates [2018-10-25 00:04:52,558 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:04:52,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:04:52,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 18 [2018-10-25 00:04:52,559 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:52,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:04:52,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:04:52,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-25 00:04:52,560 INFO L87 Difference]: Start difference. First operand 2754 states and 3424 transitions. Second operand 12 states. [2018-10-25 00:05:01,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:01,880 INFO L93 Difference]: Finished difference Result 6493 states and 8248 transitions. [2018-10-25 00:05:01,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-25 00:05:01,880 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 199 [2018-10-25 00:05:01,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:01,897 INFO L225 Difference]: With dead ends: 6493 [2018-10-25 00:05:01,898 INFO L226 Difference]: Without dead ends: 4571 [2018-10-25 00:05:01,905 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 204 GetRequests, 29 SyntacticMatches, 159 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:05:01,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4571 states. [2018-10-25 00:05:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4571 to 4420. [2018-10-25 00:05:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4420 states. [2018-10-25 00:05:02,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4420 states to 4420 states and 5415 transitions. [2018-10-25 00:05:02,020 INFO L78 Accepts]: Start accepts. Automaton has 4420 states and 5415 transitions. Word has length 199 [2018-10-25 00:05:02,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:02,020 INFO L481 AbstractCegarLoop]: Abstraction has 4420 states and 5415 transitions. [2018-10-25 00:05:02,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:05:02,021 INFO L276 IsEmpty]: Start isEmpty. Operand 4420 states and 5415 transitions. [2018-10-25 00:05:02,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-25 00:05:02,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:02,034 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:05:02,035 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:02,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:02,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1041225973, now seen corresponding path program 1 times [2018-10-25 00:05:02,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:02,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:02,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:02,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:02,036 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:02,251 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 39 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-25 00:05:02,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:02,252 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:02,252 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-10-25 00:05:02,252 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:05:02,256 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:02,256 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:03,265 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:05:03,266 INFO L272 AbstractInterpreter]: Visited 128 different actions 518 times. Merged at 9 different actions 42 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-25 00:05:03,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:03,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:05:03,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:03,273 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:05:03,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:03,283 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:05:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:03,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:05:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 103 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-25 00:05:03,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:05:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 91 proven. 31 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-25 00:05:04,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:05:04,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-25 00:05:04,048 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:05:04,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 00:05:04,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 00:05:04,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:05:04,050 INFO L87 Difference]: Start difference. First operand 4420 states and 5415 transitions. Second operand 11 states. [2018-10-25 00:05:04,375 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-25 00:05:05,586 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-10-25 00:05:08,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:08,991 INFO L93 Difference]: Finished difference Result 13534 states and 17663 transitions. [2018-10-25 00:05:08,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-25 00:05:08,993 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 207 [2018-10-25 00:05:08,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:09,035 INFO L225 Difference]: With dead ends: 13534 [2018-10-25 00:05:09,035 INFO L226 Difference]: Without dead ends: 9808 [2018-10-25 00:05:09,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 417 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-10-25 00:05:09,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9808 states. [2018-10-25 00:05:09,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9808 to 9731. [2018-10-25 00:05:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9731 states. [2018-10-25 00:05:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9731 states to 9731 states and 12049 transitions. [2018-10-25 00:05:09,375 INFO L78 Accepts]: Start accepts. Automaton has 9731 states and 12049 transitions. Word has length 207 [2018-10-25 00:05:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:09,375 INFO L481 AbstractCegarLoop]: Abstraction has 9731 states and 12049 transitions. [2018-10-25 00:05:09,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 00:05:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 9731 states and 12049 transitions. [2018-10-25 00:05:09,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-25 00:05:09,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:09,401 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:05:09,402 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:09,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:09,402 INFO L82 PathProgramCache]: Analyzing trace with hash 69921341, now seen corresponding path program 1 times [2018-10-25 00:05:09,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:09,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:09,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:09,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:09,404 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-25 00:05:09,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:09,867 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:09,867 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-10-25 00:05:09,868 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:05:09,870 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:09,870 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:10,879 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:05:10,879 INFO L272 AbstractInterpreter]: Visited 127 different actions 373 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-10-25 00:05:10,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:10,919 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:05:12,349 INFO L232 lantSequenceWeakener]: Weakened 83 states. On average, predicates are now at 81.3% of their original sizes. [2018-10-25 00:05:12,349 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:05:15,785 INFO L413 sIntCurrentIteration]: We have 215 unified AI predicates [2018-10-25 00:05:15,785 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:05:15,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:05:15,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-10-25 00:05:15,786 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:15,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-25 00:05:15,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-25 00:05:15,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:05:15,787 INFO L87 Difference]: Start difference. First operand 9731 states and 12049 transitions. Second operand 13 states. [2018-10-25 00:05:28,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:28,435 INFO L93 Difference]: Finished difference Result 18768 states and 23352 transitions. [2018-10-25 00:05:28,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-25 00:05:28,436 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 216 [2018-10-25 00:05:28,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:28,470 INFO L225 Difference]: With dead ends: 18768 [2018-10-25 00:05:28,470 INFO L226 Difference]: Without dead ends: 11135 [2018-10-25 00:05:28,491 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 220 GetRequests, 88 SyntacticMatches, 116 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:05:28,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11135 states. [2018-10-25 00:05:28,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11135 to 10986. [2018-10-25 00:05:28,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10986 states. [2018-10-25 00:05:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10986 states to 10986 states and 13426 transitions. [2018-10-25 00:05:28,770 INFO L78 Accepts]: Start accepts. Automaton has 10986 states and 13426 transitions. Word has length 216 [2018-10-25 00:05:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:28,771 INFO L481 AbstractCegarLoop]: Abstraction has 10986 states and 13426 transitions. [2018-10-25 00:05:28,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-25 00:05:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 10986 states and 13426 transitions. [2018-10-25 00:05:28,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-25 00:05:28,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:28,800 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:05:28,800 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:28,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:28,801 INFO L82 PathProgramCache]: Analyzing trace with hash -969326417, now seen corresponding path program 1 times [2018-10-25 00:05:28,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:28,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:28,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:28,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:28,802 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:29,344 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-25 00:05:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 157 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-25 00:05:29,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:29,555 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:29,555 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2018-10-25 00:05:29,556 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:05:29,561 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:29,561 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:30,783 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:05:30,783 INFO L272 AbstractInterpreter]: Visited 128 different actions 514 times. Merged at 9 different actions 38 times. Widened at 1 different actions 2 times. Found 7 fixpoints after 4 different actions. Largest state had 42 variables. [2018-10-25 00:05:30,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:30,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:05:30,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:30,789 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:05:30,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:30,798 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:05:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:30,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:05:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 140 proven. 14 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-25 00:05:30,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:05:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-25 00:05:31,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:05:31,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2018-10-25 00:05:31,415 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:05:31,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-25 00:05:31,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-25 00:05:31,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:05:31,416 INFO L87 Difference]: Start difference. First operand 10986 states and 13426 transitions. Second operand 8 states. [2018-10-25 00:05:34,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:34,283 INFO L93 Difference]: Finished difference Result 19801 states and 25043 transitions. [2018-10-25 00:05:34,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:05:34,283 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 232 [2018-10-25 00:05:34,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:34,334 INFO L225 Difference]: With dead ends: 19801 [2018-10-25 00:05:34,334 INFO L226 Difference]: Without dead ends: 12168 [2018-10-25 00:05:34,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 473 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-10-25 00:05:34,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12168 states. [2018-10-25 00:05:34,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12168 to 11380. [2018-10-25 00:05:34,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11380 states. [2018-10-25 00:05:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11380 states to 11380 states and 13523 transitions. [2018-10-25 00:05:34,661 INFO L78 Accepts]: Start accepts. Automaton has 11380 states and 13523 transitions. Word has length 232 [2018-10-25 00:05:34,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:34,662 INFO L481 AbstractCegarLoop]: Abstraction has 11380 states and 13523 transitions. [2018-10-25 00:05:34,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-25 00:05:34,662 INFO L276 IsEmpty]: Start isEmpty. Operand 11380 states and 13523 transitions. [2018-10-25 00:05:34,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-25 00:05:34,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:34,690 INFO L375 BasicCegarLoop]: trace histogram [5, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:05:34,691 INFO L424 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:34,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:34,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1797507141, now seen corresponding path program 1 times [2018-10-25 00:05:34,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:34,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:34,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:34,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:34,693 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:35,700 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-25 00:05:35,944 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 174 proven. 52 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-25 00:05:35,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:35,945 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:35,945 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-10-25 00:05:35,945 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [41], [42], [46], [50], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:05:35,948 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:35,948 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:37,061 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:05:37,061 INFO L272 AbstractInterpreter]: Visited 128 different actions 517 times. Merged at 9 different actions 41 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:05:37,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:37,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:05:37,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:37,083 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:05:37,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:37,092 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:05:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:37,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:05:37,285 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 185 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-25 00:05:37,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:05:37,608 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 185 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-25 00:05:37,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:05:37,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2018-10-25 00:05:37,630 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:05:37,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:05:37,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:05:37,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:05:37,632 INFO L87 Difference]: Start difference. First operand 11380 states and 13523 transitions. Second operand 12 states. [2018-10-25 00:05:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:42,151 INFO L93 Difference]: Finished difference Result 20879 states and 26552 transitions. [2018-10-25 00:05:42,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-25 00:05:42,152 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 242 [2018-10-25 00:05:42,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:42,193 INFO L225 Difference]: With dead ends: 20879 [2018-10-25 00:05:42,194 INFO L226 Difference]: Without dead ends: 11453 [2018-10-25 00:05:42,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 501 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=418, Invalid=1652, Unknown=0, NotChecked=0, Total=2070 [2018-10-25 00:05:42,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11453 states. [2018-10-25 00:05:42,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11453 to 10478. [2018-10-25 00:05:42,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10478 states. [2018-10-25 00:05:42,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10478 states to 10478 states and 11956 transitions. [2018-10-25 00:05:42,508 INFO L78 Accepts]: Start accepts. Automaton has 10478 states and 11956 transitions. Word has length 242 [2018-10-25 00:05:42,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:42,508 INFO L481 AbstractCegarLoop]: Abstraction has 10478 states and 11956 transitions. [2018-10-25 00:05:42,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:05:42,508 INFO L276 IsEmpty]: Start isEmpty. Operand 10478 states and 11956 transitions. [2018-10-25 00:05:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-25 00:05:42,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:42,533 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:05:42,533 INFO L424 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:42,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:42,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1055628796, now seen corresponding path program 1 times [2018-10-25 00:05:42,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:42,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:42,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:42,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:42,535 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 175 proven. 93 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-25 00:05:43,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:43,416 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:43,416 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 260 with the following transitions: [2018-10-25 00:05:43,417 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [41], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [129], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:05:43,419 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:43,419 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:44,511 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:05:44,511 INFO L272 AbstractInterpreter]: Visited 129 different actions 658 times. Merged at 10 different actions 61 times. Widened at 1 different actions 6 times. Found 13 fixpoints after 4 different actions. Largest state had 42 variables. [2018-10-25 00:05:44,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:44,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:05:44,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:44,517 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:05:44,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:44,526 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:05:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:44,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:05:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 217 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-25 00:05:44,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:05:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 217 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-10-25 00:05:44,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:05:44,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-10-25 00:05:44,997 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:05:44,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-25 00:05:44,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-25 00:05:44,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-10-25 00:05:44,998 INFO L87 Difference]: Start difference. First operand 10478 states and 11956 transitions. Second operand 12 states. [2018-10-25 00:05:49,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:49,833 INFO L93 Difference]: Finished difference Result 19523 states and 23019 transitions. [2018-10-25 00:05:49,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-25 00:05:49,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 259 [2018-10-25 00:05:49,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:49,855 INFO L225 Difference]: With dead ends: 19523 [2018-10-25 00:05:49,855 INFO L226 Difference]: Without dead ends: 8826 [2018-10-25 00:05:49,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 542 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=431, Invalid=1731, Unknown=0, NotChecked=0, Total=2162 [2018-10-25 00:05:49,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8826 states. [2018-10-25 00:05:50,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8826 to 7128. [2018-10-25 00:05:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7128 states. [2018-10-25 00:05:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7128 states to 7128 states and 7806 transitions. [2018-10-25 00:05:50,059 INFO L78 Accepts]: Start accepts. Automaton has 7128 states and 7806 transitions. Word has length 259 [2018-10-25 00:05:50,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:50,060 INFO L481 AbstractCegarLoop]: Abstraction has 7128 states and 7806 transitions. [2018-10-25 00:05:50,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-25 00:05:50,060 INFO L276 IsEmpty]: Start isEmpty. Operand 7128 states and 7806 transitions. [2018-10-25 00:05:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-25 00:05:50,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:50,075 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:05:50,075 INFO L424 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:50,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:50,075 INFO L82 PathProgramCache]: Analyzing trace with hash -317338975, now seen corresponding path program 1 times [2018-10-25 00:05:50,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:50,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:50,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:50,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:50,076 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:50,501 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 246 proven. 112 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-25 00:05:50,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:50,502 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:50,502 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 279 with the following transitions: [2018-10-25 00:05:50,502 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [37], [38], [42], [46], [50], [53], [54], [58], [62], [66], [70], [74], [77], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:05:50,504 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:50,505 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:51,649 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:05:51,649 INFO L272 AbstractInterpreter]: Visited 130 different actions 533 times. Merged at 11 different actions 49 times. Widened at 1 different actions 1 times. Found 11 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:05:51,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:51,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:05:51,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:51,655 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:05:51,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:51,664 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:05:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:51,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:05:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-10-25 00:05:52,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:05:52,802 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-10-25 00:05:52,836 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:05:52,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-10-25 00:05:52,836 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:52,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:05:52,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:05:52,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:05:52,838 INFO L87 Difference]: Start difference. First operand 7128 states and 7806 transitions. Second operand 3 states. [2018-10-25 00:05:53,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:53,368 INFO L93 Difference]: Finished difference Result 12147 states and 13392 transitions. [2018-10-25 00:05:53,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:05:53,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2018-10-25 00:05:53,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:53,381 INFO L225 Difference]: With dead ends: 12147 [2018-10-25 00:05:53,381 INFO L226 Difference]: Without dead ends: 7128 [2018-10-25 00:05:53,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 556 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:05:53,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7128 states. [2018-10-25 00:05:53,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7128 to 6854. [2018-10-25 00:05:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6854 states. [2018-10-25 00:05:53,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6854 states to 6854 states and 7484 transitions. [2018-10-25 00:05:53,530 INFO L78 Accepts]: Start accepts. Automaton has 6854 states and 7484 transitions. Word has length 278 [2018-10-25 00:05:53,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:53,531 INFO L481 AbstractCegarLoop]: Abstraction has 6854 states and 7484 transitions. [2018-10-25 00:05:53,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:05:53,531 INFO L276 IsEmpty]: Start isEmpty. Operand 6854 states and 7484 transitions. [2018-10-25 00:05:53,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-25 00:05:53,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:53,543 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:05:53,543 INFO L424 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:53,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:53,543 INFO L82 PathProgramCache]: Analyzing trace with hash -757481712, now seen corresponding path program 1 times [2018-10-25 00:05:53,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:53,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:53,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:53,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:53,544 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:54,059 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 265 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-25 00:05:54,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:54,059 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:54,059 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 282 with the following transitions: [2018-10-25 00:05:54,060 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [37], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [105], [106], [109], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [605], [607], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-25 00:05:54,062 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:54,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:54,948 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:05:54,949 INFO L272 AbstractInterpreter]: Visited 129 different actions 527 times. Merged at 9 different actions 47 times. Widened at 1 different actions 6 times. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-25 00:05:54,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:54,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:05:54,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:54,960 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:05:54,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:54,969 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:05:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:55,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:05:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 265 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-25 00:05:55,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:05:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 265 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-25 00:05:55,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:05:55,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-10-25 00:05:55,331 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:05:55,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-25 00:05:55,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-25 00:05:55,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:05:55,333 INFO L87 Difference]: Start difference. First operand 6854 states and 7484 transitions. Second operand 9 states. [2018-10-25 00:05:56,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:56,275 INFO L93 Difference]: Finished difference Result 10500 states and 11607 transitions. [2018-10-25 00:05:56,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-25 00:05:56,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 281 [2018-10-25 00:05:56,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:56,276 INFO L225 Difference]: With dead ends: 10500 [2018-10-25 00:05:56,276 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:05:56,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 563 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-10-25 00:05:56,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:05:56,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:05:56,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:05:56,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:05:56,291 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2018-10-25 00:05:56,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:56,292 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:05:56,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-25 00:05:56,292 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:05:56,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:05:56,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:05:56,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:56,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:56,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:56,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:56,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:57,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:57,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:57,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:57,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:57,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:57,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:57,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:57,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:57,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:57,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:57,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:57,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:57,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:57,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:57,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:57,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:58,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:58,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:58,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:58,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:58,344 WARN L179 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 561 DAG size of output: 442 [2018-10-25 00:05:58,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:58,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:58,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:58,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:58,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:58,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:58,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:58,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:59,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:59,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:59,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:59,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:59,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:59,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:59,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:59,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:59,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:59,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:59,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:59,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:59,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:05:59,478 WARN L179 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 549 DAG size of output: 431 [2018-10-25 00:06:00,539 WARN L179 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-10-25 00:06:01,094 WARN L179 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 86 [2018-10-25 00:06:04,968 WARN L179 SmtUtils]: Spent 3.84 s on a formula simplification. DAG size of input: 387 DAG size of output: 163 [2018-10-25 00:06:08,305 WARN L179 SmtUtils]: Spent 3.31 s on a formula simplification. DAG size of input: 451 DAG size of output: 151 [2018-10-25 00:06:11,423 WARN L179 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 441 DAG size of output: 143 [2018-10-25 00:06:11,426 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:06:11,426 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a8~0 |old(~a8~0)|) (= ~a17~0 |old(~a17~0)|) (= |old(~a7~0)| ~a7~0) (<= |old(~a8~0)| ~a8~0) (= |old(~a16~0)| ~a16~0) (= ~a20~0 |old(~a20~0)|) (= ~a21~0 |old(~a21~0)|)) [2018-10-25 00:06:11,427 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:06:11,427 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-25 00:06:11,427 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-25 00:06:11,427 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,427 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,427 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,427 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,427 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,428 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,428 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-25 00:06:11,428 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-25 00:06:11,428 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 518) no Hoare annotation was computed. [2018-10-25 00:06:11,428 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-25 00:06:11,428 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-25 00:06:11,428 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-25 00:06:11,428 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-25 00:06:11,428 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-25 00:06:11,428 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-25 00:06:11,428 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-25 00:06:11,428 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-25 00:06:11,428 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,429 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,429 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,429 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,429 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,429 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,429 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-25 00:06:11,429 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-25 00:06:11,429 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-25 00:06:11,429 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-25 00:06:11,429 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-25 00:06:11,430 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-25 00:06:11,430 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-25 00:06:11,430 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-25 00:06:11,430 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-25 00:06:11,430 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-25 00:06:11,430 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-25 00:06:11,430 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-25 00:06:11,430 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-25 00:06:11,430 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-25 00:06:11,430 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-25 00:06:11,430 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,430 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,430 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,430 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,430 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,431 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-25 00:06:11,431 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-25 00:06:11,431 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-25 00:06:11,431 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-25 00:06:11,431 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-25 00:06:11,431 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-25 00:06:11,431 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-25 00:06:11,431 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-25 00:06:11,431 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-25 00:06:11,431 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,431 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,431 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,432 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,432 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,432 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-25 00:06:11,432 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-25 00:06:11,432 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-25 00:06:11,432 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-25 00:06:11,432 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-25 00:06:11,432 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-25 00:06:11,432 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-25 00:06:11,432 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-25 00:06:11,433 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-25 00:06:11,433 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-25 00:06:11,433 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-25 00:06:11,433 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-25 00:06:11,433 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-25 00:06:11,433 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,433 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,433 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,433 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,434 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,434 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-25 00:06:11,434 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-25 00:06:11,434 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-25 00:06:11,434 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-25 00:06:11,434 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-25 00:06:11,434 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-25 00:06:11,434 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-25 00:06:11,434 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-25 00:06:11,435 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-25 00:06:11,435 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,435 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,435 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,435 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,435 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,435 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,435 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-25 00:06:11,435 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,435 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-25 00:06:11,436 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-25 00:06:11,436 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-25 00:06:11,436 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-25 00:06:11,436 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-25 00:06:11,436 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-25 00:06:11,436 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-25 00:06:11,436 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-25 00:06:11,436 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-25 00:06:11,436 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-25 00:06:11,436 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-25 00:06:11,436 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-25 00:06:11,437 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-25 00:06:11,437 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,437 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,437 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,437 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,437 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,437 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-25 00:06:11,437 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-25 00:06:11,437 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-25 00:06:11,437 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-25 00:06:11,438 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-25 00:06:11,438 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-25 00:06:11,438 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-25 00:06:11,438 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-25 00:06:11,438 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,438 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,438 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,438 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,438 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,438 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-25 00:06:11,439 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-25 00:06:11,439 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-25 00:06:11,439 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-25 00:06:11,439 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-25 00:06:11,439 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-25 00:06:11,439 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-25 00:06:11,439 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-25 00:06:11,439 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-25 00:06:11,439 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-25 00:06:11,440 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse6 (<= ~a21~0 |old(~a21~0)|)) (.cse20 (= 1 ~a21~0)) (.cse4 (= |old(~a16~0)| ~a16~0)) (.cse29 (<= ~a8~0 |old(~a8~0)|)) (.cse5 (= ~a17~0 |old(~a17~0)|)) (.cse7 (= |old(~a7~0)| ~a7~0)) (.cse30 (<= |old(~a8~0)| ~a8~0)) (.cse8 (= ~a20~0 |old(~a20~0)|)) (.cse11 (= 1 |old(~a17~0)|)) (.cse22 (= 4 |old(~a16~0)|))) (let ((.cse2 (not .cse22)) (.cse21 (not (= 13 |old(~a8~0)|))) (.cse9 (not .cse11)) (.cse26 (= ~a20~0 1)) (.cse17 (not (= 0 |old(~a7~0)|))) (.cse19 (not (= 15 |old(~a8~0)|))) (.cse27 (= |calculate_output_#in~input| 0)) (.cse25 (< |old(~a20~0)| 1)) (.cse1 (not (= 1 |old(~a20~0)|))) (.cse14 (< 0 |old(~a21~0)|)) (.cse13 (and .cse4 (= ~a21~0 |old(~a21~0)|) .cse29 .cse5 .cse7 .cse30 .cse8)) (.cse28 (< |old(~a8~0)| 15)) (.cse18 (not (= 1 |old(~a21~0)|))) (.cse24 (< |old(~a8~0)| 14)) (.cse16 (and .cse4 .cse29 .cse5 .cse7 .cse30 .cse20 .cse8)) (.cse23 (= 6 |old(~a16~0)|)) (.cse0 (= 1 |old(~a7~0)|)) (.cse10 (and .cse4 .cse29 .cse5 .cse6 .cse7 .cse8)) (.cse3 (not (= 8 ~a12~0))) (.cse12 (< 14 |old(~a8~0)|)) (.cse15 (< 0 |old(~a20~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (or .cse0 .cse1 .cse10 .cse3 .cse11 .cse12) (or .cse13 (< 4 |old(~a16~0)|) .cse3 .cse12 .cse14 .cse15) (or .cse0 .cse10 .cse2 .cse3 .cse11 .cse12 .cse15) (or .cse16 (or (or .cse17 .cse18 .cse19 .cse3) .cse15)) (or .cse18 .cse1 .cse2 .cse3 (and (= 13 ~a8~0) .cse20) .cse21 .cse9) (or .cse0 .cse22 .cse1 .cse10 .cse3 .cse12) (or .cse23 .cse18 .cse22 .cse24 .cse3 .cse11 .cse16 .cse12) (or .cse0 .cse22 .cse3 .cse25 .cse11 .cse12 .cse10) (or (and (= ~a16~0 5) (= ~a8~0 15) .cse20 (= ~a7~0 0) .cse5 .cse26) (not (= |old(~a16~0)| 5)) (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) .cse27 (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) (not (= |old(~a20~0)| 1))) (or .cse18 .cse16 (or .cse0 .cse22 .cse1 .cse3 .cse11) .cse28) (or .cse18 .cse1 .cse2 (and (= 1 ~a7~0) (= 1 ~a20~0) .cse4 (= 1 ~a17~0)) .cse3 (not .cse0) .cse21 .cse9) (or (and .cse4 .cse29 .cse20 .cse5 .cse7 .cse30 .cse26) .cse11 (or .cse17 .cse18 .cse1 .cse19 .cse3 .cse27)) (or .cse22 .cse3 .cse25 .cse11 .cse12 .cse14 .cse13) (or (or .cse23 .cse1 .cse3 .cse14) .cse13 .cse12) (or .cse23 .cse18 .cse0 .cse3 .cse16 .cse28 .cse15) (or .cse23 .cse18 .cse24 .cse16 .cse3 .cse11 .cse15) (or .cse23 .cse0 .cse22 .cse10 .cse3 .cse12 .cse15)))) [2018-10-25 00:06:11,440 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-25 00:06:11,440 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,441 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,441 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,441 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,441 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-25 00:06:11,441 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,441 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,441 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-25 00:06:11,441 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-25 00:06:11,441 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-25 00:06:11,442 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-25 00:06:11,442 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-25 00:06:11,442 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-25 00:06:11,442 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-25 00:06:11,442 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-25 00:06:11,442 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-25 00:06:11,442 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-25 00:06:11,442 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-25 00:06:11,442 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-25 00:06:11,443 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,443 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,443 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,443 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,443 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,443 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-25 00:06:11,443 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,443 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-25 00:06:11,443 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-25 00:06:11,443 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-25 00:06:11,444 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-25 00:06:11,444 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-25 00:06:11,444 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-25 00:06:11,444 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-25 00:06:11,444 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-25 00:06:11,444 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-25 00:06:11,444 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-25 00:06:11,444 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-25 00:06:11,444 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-25 00:06:11,444 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-25 00:06:11,445 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-25 00:06:11,445 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,445 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,445 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,445 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,445 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,445 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-25 00:06:11,445 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-25 00:06:11,445 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-25 00:06:11,445 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-25 00:06:11,445 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-25 00:06:11,446 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-25 00:06:11,446 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-25 00:06:11,446 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-25 00:06:11,446 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-25 00:06:11,446 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-25 00:06:11,446 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-25 00:06:11,446 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:06:11,446 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= 1 ~a21~0) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-10-25 00:06:11,446 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:06:11,447 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:06:11,447 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23)) (and (= ~a16~0 5) (= ~a8~0 15) (= 1 ~a21~0) (= ~a7~0 0) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 1))) [2018-10-25 00:06:11,447 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:06:11,447 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse4 (<= 14 ~a8~0)) (.cse3 (= ~a20~0 |old(~a20~0)|)) (.cse0 (not (= main_~input~0 0))) (.cse13 (= ~a7~0 0)) (.cse11 (= ~a8~0 15)) (.cse12 (= ~a21~0 1)) (.cse14 (= 1 ~a20~0)) (.cse2 (= 1 ~a21~0)) (.cse9 (<= ~a20~0 0)) (.cse5 (not (= ~a16~0 6))) (.cse17 (= |old(~a20~0)| ~a20~0)) (.cse15 (= 4 ~a16~0)) (.cse16 (= 1 ~a17~0)) (.cse8 (<= ~a21~0 0)) (.cse10 (not (= ~a7~0 1))) (.cse1 (not (= ~a17~0 1))) (.cse7 (not (= ~a16~0 4))) (.cse18 (<= 1 ~a20~0)) (.cse6 (<= ~a8~0 14))) (or (and .cse0 .cse1 (<= ~a8~0 |old(~a8~0)|) (= ~a7~0 |old(~a7~0)|) .cse2 .cse3) (and .cse4 .cse5 .cse2 .cse1 .cse6 .cse7) (and .cse8 .cse6 .cse9 (<= ~a16~0 4)) (and (and (and .cse10 .cse5 .cse7) .cse9) .cse6) (and (and .cse5 .cse1 .cse9) .cse4 .cse2) (and .cse3 (and .cse11 .cse12 .cse0 (not (= main_~output~0 0)) .cse13) (= ~a16~0 5)) (and .cse14 (= 13 ~a8~0) .cse15 .cse2 .cse16) (and (and .cse13 .cse11 .cse12) .cse9) (and (and (and .cse10 .cse1 .cse7) .cse14) .cse2) (not (= 3 ~c~0)) (not (= 1 |old(~a21~0)|)) (not (= 4 ~d~0)) (not (= 2 ~b~0)) (not (= ~y~0 25)) (and (and (and .cse10 .cse5 .cse9) (<= 15 ~a8~0)) .cse2) (not (= ~x~0 24)) (not (= ~a12~0 8)) (and (and .cse10 .cse15 .cse1 .cse9) .cse6) (not (= ~e~0 5)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and (and .cse8 .cse17 .cse5) .cse6) (and .cse10 .cse17 .cse6) (and .cse10 .cse17 .cse15 .cse16) (not (= ~z~0 26)) (and .cse8 .cse1 .cse6 .cse18 .cse7) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (and (and .cse10 .cse1 .cse7 .cse18) .cse6) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)))) [2018-10-25 00:06:11,447 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-25 00:06:11,448 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-25 00:06:11,448 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-25 00:06:11,448 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse4 (<= 14 ~a8~0)) (.cse11 (= 1 ~a20~0)) (.cse2 (= 1 ~a21~0)) (.cse9 (<= ~a20~0 0)) (.cse14 (= ~a8~0 15)) (.cse0 (not (= main_~input~0 0))) (.cse15 (= ~a21~0 1)) (.cse16 (= ~a12~0 8)) (.cse3 (= ~a20~0 |old(~a20~0)|)) (.cse5 (not (= ~a16~0 6))) (.cse18 (= |old(~a20~0)| ~a20~0)) (.cse12 (= 4 ~a16~0)) (.cse13 (= 1 ~a17~0)) (.cse8 (<= ~a21~0 0)) (.cse10 (not (= ~a7~0 1))) (.cse1 (not (= ~a17~0 1))) (.cse7 (not (= ~a16~0 4))) (.cse19 (<= 1 ~a20~0)) (.cse6 (<= ~a8~0 14))) (or (and .cse0 .cse1 (<= ~a8~0 |old(~a8~0)|) (= ~a7~0 |old(~a7~0)|) .cse2 .cse3) (and .cse4 .cse5 .cse2 .cse1 .cse6 .cse7) (and .cse8 .cse6 .cse9 (<= ~a16~0 4)) (and (and (and .cse10 .cse5 .cse7) .cse9) .cse6) (and (and .cse5 .cse1 .cse9) .cse4 .cse2) (and .cse11 (= 13 ~a8~0) .cse12 .cse2 .cse13) (and (and (= ~a7~0 0) .cse14 .cse15) .cse9) (and (and (and .cse10 .cse1 .cse7) .cse11) .cse2) (not (= 3 ~c~0)) (not (= 1 |old(~a21~0)|)) (not (= 4 ~d~0)) (not (= 2 ~b~0)) (not (= ~y~0 25)) (and (and (and .cse10 .cse5 .cse9) (<= 15 ~a8~0)) .cse2) (not (= ~x~0 24)) (not .cse16) (and (and .cse10 .cse12 .cse1 .cse9) .cse6) (not (= ~e~0 5)) (and (and (not (= main_~output~0 0)) (let ((.cse17 (and (= |old(~a7~0)| ~a7~0) .cse16))) (or (and (and .cse14 (= (+ main_~output~0 1) 0) .cse15) .cse17) (and .cse14 .cse0 .cse15 .cse17))) (= ~a16~0 5)) .cse3) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and (and .cse8 .cse18 .cse5) .cse6) (and .cse10 .cse18 .cse6) (and .cse10 .cse18 .cse12 .cse13) (not (= ~z~0 26)) (and .cse8 .cse1 .cse6 .cse19 .cse7) (not (= |old(~a16~0)| 5)) (not (= 0 |old(~a7~0)|)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= 15 |old(~a8~0)|)) (not (= ~a~0 1)) (and (and .cse10 .cse1 .cse7 .cse19) .cse6) (not (= |old(~a17~0)| 1)) (not (= 6 ~f~0)))) [2018-10-25 00:06:11,448 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-25 00:06:11,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:06:11 BoogieIcfgContainer [2018-10-25 00:06:11,476 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:06:11,479 INFO L168 Benchmark]: Toolchain (without parser) took 146393.72 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 3.8 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-10-25 00:06:11,480 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:06:11,481 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:06:11,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 215.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -836.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-25 00:06:11,484 INFO L168 Benchmark]: Boogie Preprocessor took 110.57 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:06:11,485 INFO L168 Benchmark]: RCFGBuilder took 3236.02 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: 116.8 MB). Peak memory consumption was 116.8 MB. Max. memory is 7.1 GB. [2018-10-25 00:06:11,485 INFO L168 Benchmark]: TraceAbstraction took 142098.58 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-25 00:06:11,491 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.20 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 728.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 215.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -836.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 110.57 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3236.02 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: 116.8 MB). Peak memory consumption was 116.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 142098.58 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 3.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 518]: 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: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((!(input == 0) && !(a17 == 1)) && a8 <= \old(a8)) && a7 == \old(a7)) && 1 == a21) && a20 == \old(a20)) || (((((14 <= a8 && !(a16 == 6)) && 1 == a21) && !(a17 == 1)) && a8 <= 14) && !(a16 == 4))) || (((a21 <= 0 && a8 <= 14) && a20 <= 0) && a16 <= 4)) || ((((!(a7 == 1) && !(a16 == 6)) && !(a16 == 4)) && a20 <= 0) && a8 <= 14)) || ((((!(a16 == 6) && !(a17 == 1)) && a20 <= 0) && 14 <= a8) && 1 == a21)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || (((a7 == 0 && a8 == 15) && a21 == 1) && a20 <= 0)) || ((((!(a7 == 1) && !(a17 == 1)) && !(a16 == 4)) && 1 == a20) && 1 == a21)) || !(3 == c)) || !(1 == \old(a21))) || !(4 == d)) || !(2 == b)) || !(y == 25)) || ((((!(a7 == 1) && !(a16 == 6)) && a20 <= 0) && 15 <= a8) && 1 == a21)) || !(x == 24)) || !(a12 == 8)) || ((((!(a7 == 1) && 4 == a16) && !(a17 == 1)) && a20 <= 0) && a8 <= 14)) || !(e == 5)) || (((!(output == 0) && ((((a8 == 15 && output + 1 == 0) && a21 == 1) && \old(a7) == a7 && a12 == 8) || (((a8 == 15 && !(input == 0)) && a21 == 1) && \old(a7) == a7 && a12 == 8))) && a16 == 5) && a20 == \old(a20))) || !(21 == u)) || !(22 == v)) || (((a21 <= 0 && \old(a20) == a20) && !(a16 == 6)) && a8 <= 14)) || ((!(a7 == 1) && \old(a20) == a20) && a8 <= 14)) || (((!(a7 == 1) && \old(a20) == a20) && 4 == a16) && 1 == a17)) || !(z == 26)) || ((((a21 <= 0 && !(a17 == 1)) && a8 <= 14) && 1 <= a20) && !(a16 == 4))) || !(\old(a16) == 5)) || !(0 == \old(a7))) || !(\old(a20) == 1)) || !(23 == w)) || !(15 == \old(a8))) || !(a == 1)) || ((((!(a7 == 1) && !(a17 == 1)) && !(a16 == 4)) && 1 <= a20) && a8 <= 14)) || !(\old(a17) == 1)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 142.0s OverallTime, 17 OverallIterations, 7 TraceHistogramMax, 85.1s AutomataDifference, 0.0s DeadEndRemovalTime, 15.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 2042 SDtfs, 15090 SDslu, 2935 SDs, 0 SdLazy, 25624 SolverSat, 2980 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.9s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 4192 GetRequests, 3536 SyntacticMatches, 410 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3736 ImplicationChecksByTransitivity, 21.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11380occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.7s AbstIntTime, 11 AbstIntIterations, 5 AbstIntStrong, 0.9974851585599551 AbsIntWeakeningRatio, 0.20662983425414364 AbsIntAvgWeakeningVarsNumRemoved, 5.414364640883978 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 4175 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 439 PreInvPairs, 587 NumberOfFragments, 1755 HoareAnnotationTreeSize, 439 FomulaSimplifications, 98674 FormulaSimplificationTreeSizeReduction, 3.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 92311 FormulaSimplificationTreeSizeReductionInter, 11.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 4707 NumberOfCodeBlocks, 4707 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 6177 ConstructedInterpolants, 0 QuantifiedInterpolants, 3177349 SizeOfPredicates, 7 NumberOfNonLiveVariables, 4010 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 29 InterpolantComputations, 8 PerfectInterpolantSequences, 5362/5781 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...