java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 04:55:02,211 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 04:55:02,213 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 04:55:02,231 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 04:55:02,231 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 04:55:02,232 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 04:55:02,234 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 04:55:02,238 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 04:55:02,241 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 04:55:02,242 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 04:55:02,244 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 04:55:02,244 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 04:55:02,246 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 04:55:02,253 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 04:55:02,255 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 04:55:02,259 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 04:55:02,260 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 04:55:02,264 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 04:55:02,269 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 04:55:02,273 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 04:55:02,275 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 04:55:02,277 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 04:55:02,281 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 04:55:02,281 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 04:55:02,282 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 04:55:02,285 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 04:55:02,286 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 04:55:02,287 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 04:55:02,289 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 04:55:02,292 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 04:55:02,292 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 04:55:02,293 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 04:55:02,294 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 04:55:02,294 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 04:55:02,296 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 04:55:02,297 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 04:55:02,297 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 04:55:02,325 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 04:55:02,326 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 04:55:02,327 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 04:55:02,328 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 04:55:02,328 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 04:55:02,328 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 04:55:02,329 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 04:55:02,329 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 04:55:02,329 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 04:55:02,330 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 04:55:02,330 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 04:55:02,330 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 04:55:02,331 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 04:55:02,332 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 04:55:02,332 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 04:55:02,332 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 04:55:02,332 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 04:55:02,335 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 04:55:02,335 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 04:55:02,335 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 04:55:02,335 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 04:55:02,336 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 04:55:02,336 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 04:55:02,336 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 04:55:02,337 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:55:02,337 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 04:55:02,337 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 04:55:02,337 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 04:55:02,337 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 04:55:02,338 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 04:55:02,338 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 04:55:02,338 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 04:55:02,338 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 04:55:02,338 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 04:55:02,411 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 04:55:02,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 04:55:02,436 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 04:55:02,438 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 04:55:02,439 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 04:55:02,440 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-11-07 04:55:02,518 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02afd1b6e/fd87cb658964454c8f999c3014465c5c/FLAG241fb1e93 [2018-11-07 04:55:03,023 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 04:55:03,024 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-11-07 04:55:03,031 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02afd1b6e/fd87cb658964454c8f999c3014465c5c/FLAG241fb1e93 [2018-11-07 04:55:03,046 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02afd1b6e/fd87cb658964454c8f999c3014465c5c [2018-11-07 04:55:03,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 04:55:03,059 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 04:55:03,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 04:55:03,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 04:55:03,064 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 04:55:03,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:55:03" (1/1) ... [2018-11-07 04:55:03,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36cdc79c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:03, skipping insertion in model container [2018-11-07 04:55:03,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:55:03" (1/1) ... [2018-11-07 04:55:03,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 04:55:03,101 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 04:55:03,360 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:55:03,371 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 04:55:03,402 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:55:03,434 INFO L193 MainTranslator]: Completed translation [2018-11-07 04:55:03,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:03 WrapperNode [2018-11-07 04:55:03,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 04:55:03,437 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 04:55:03,437 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 04:55:03,437 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 04:55:03,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:03" (1/1) ... [2018-11-07 04:55:03,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:03" (1/1) ... [2018-11-07 04:55:03,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 04:55:03,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 04:55:03,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 04:55:03,468 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 04:55:03,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:03" (1/1) ... [2018-11-07 04:55:03,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:03" (1/1) ... [2018-11-07 04:55:03,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:03" (1/1) ... [2018-11-07 04:55:03,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:03" (1/1) ... [2018-11-07 04:55:03,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:03" (1/1) ... [2018-11-07 04:55:03,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:03" (1/1) ... [2018-11-07 04:55:03,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:03" (1/1) ... [2018-11-07 04:55:03,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 04:55:03,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 04:55:03,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 04:55:03,535 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 04:55:03,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:55:03,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 04:55:03,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 04:55:03,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 04:55:03,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 04:55:03,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 04:55:03,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 04:55:03,663 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2018-11-07 04:55:03,664 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2018-11-07 04:55:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 04:55:03,664 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 04:55:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 04:55:03,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-07 04:55:03,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 04:55:03,665 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 04:55:03,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 04:55:04,178 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 04:55:04,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:55:04 BoogieIcfgContainer [2018-11-07 04:55:04,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 04:55:04,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 04:55:04,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 04:55:04,183 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 04:55:04,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:55:03" (1/3) ... [2018-11-07 04:55:04,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454e45d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:55:04, skipping insertion in model container [2018-11-07 04:55:04,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:55:03" (2/3) ... [2018-11-07 04:55:04,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454e45d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:55:04, skipping insertion in model container [2018-11-07 04:55:04,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:55:04" (3/3) ... [2018-11-07 04:55:04,187 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05_true-unreach-call_true-termination.i [2018-11-07 04:55:04,197 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 04:55:04,206 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 04:55:04,224 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 04:55:04,260 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 04:55:04,260 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 04:55:04,260 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 04:55:04,260 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 04:55:04,261 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 04:55:04,262 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 04:55:04,262 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 04:55:04,262 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 04:55:04,285 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-07 04:55:04,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 04:55:04,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:04,294 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] [2018-11-07 04:55:04,296 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:04,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:04,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1074107771, now seen corresponding path program 1 times [2018-11-07 04:55:04,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:04,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:04,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:04,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:04,365 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:04,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:55:04,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:55:04,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 04:55:04,501 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:55:04,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 04:55:04,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 04:55:04,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 04:55:04,527 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-11-07 04:55:04,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:04,555 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2018-11-07 04:55:04,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 04:55:04,557 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-11-07 04:55:04,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:04,565 INFO L225 Difference]: With dead ends: 94 [2018-11-07 04:55:04,565 INFO L226 Difference]: Without dead ends: 50 [2018-11-07 04:55:04,569 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 04:55:04,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-07 04:55:04,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-07 04:55:04,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 04:55:04,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-07 04:55:04,610 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 28 [2018-11-07 04:55:04,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:04,612 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-07 04:55:04,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 04:55:04,612 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-07 04:55:04,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-07 04:55:04,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:04,614 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] [2018-11-07 04:55:04,614 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:04,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:04,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2084935887, now seen corresponding path program 1 times [2018-11-07 04:55:04,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:04,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:04,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:04,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:04,616 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:55:04,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:55:04,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 04:55:04,716 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:55:04,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 04:55:04,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 04:55:04,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:55:04,719 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 3 states. [2018-11-07 04:55:04,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:04,819 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-11-07 04:55:04,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 04:55:04,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-07 04:55:04,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:04,821 INFO L225 Difference]: With dead ends: 86 [2018-11-07 04:55:04,821 INFO L226 Difference]: Without dead ends: 54 [2018-11-07 04:55:04,823 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 04:55:04,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-07 04:55:04,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-07 04:55:04,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-07 04:55:04,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-07 04:55:04,832 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 30 [2018-11-07 04:55:04,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:04,832 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-07 04:55:04,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 04:55:04,833 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-07 04:55:04,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-07 04:55:04,834 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:04,834 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 04:55:04,834 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:04,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:04,835 INFO L82 PathProgramCache]: Analyzing trace with hash -537387848, now seen corresponding path program 1 times [2018-11-07 04:55:04,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:04,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:04,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:04,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:04,837 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:04,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:55:04,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:04,939 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:04,940 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-11-07 04:55:04,942 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [12], [16], [19], [54], [55], [56], [60], [63], [65], [66], [68], [73], [77], [82], [83], [94], [97], [99], [105], [106], [107], [109], [110], [111] [2018-11-07 04:55:04,997 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:55:04,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:55:05,369 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 04:55:05,371 INFO L272 AbstractInterpreter]: Visited 23 different actions 48 times. Merged at 4 different actions 20 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 21 variables. [2018-11-07 04:55:05,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:05,400 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 04:55:05,611 INFO L227 lantSequenceWeakener]: Weakened 23 states. On average, predicates are now at 77.58% of their original sizes. [2018-11-07 04:55:05,611 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 04:55:06,093 INFO L415 sIntCurrentIteration]: We unified 33 AI predicates to 33 [2018-11-07 04:55:06,093 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 04:55:06,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 04:55:06,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2018-11-07 04:55:06,095 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:55:06,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 04:55:06,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 04:55:06,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-07 04:55:06,096 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 8 states. [2018-11-07 04:55:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:07,267 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-11-07 04:55:07,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 04:55:07,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-11-07 04:55:07,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:07,271 INFO L225 Difference]: With dead ends: 88 [2018-11-07 04:55:07,271 INFO L226 Difference]: Without dead ends: 73 [2018-11-07 04:55:07,272 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-07 04:55:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-07 04:55:07,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 54. [2018-11-07 04:55:07,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 04:55:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-07 04:55:07,290 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 34 [2018-11-07 04:55:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:07,290 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-07 04:55:07,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 04:55:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-07 04:55:07,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-07 04:55:07,292 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:07,293 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 04:55:07,293 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:07,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:07,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1292749679, now seen corresponding path program 1 times [2018-11-07 04:55:07,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:07,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:07,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:07,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:07,296 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 04:55:07,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:07,455 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:07,456 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-11-07 04:55:07,456 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [12], [16], [19], [21], [25], [28], [43], [44], [45], [46], [47], [48], [50], [54], [55], [56], [60], [63], [65], [66], [68], [73], [77], [82], [83], [94], [97], [99], [105], [106], [107], [109], [110], [111] [2018-11-07 04:55:07,459 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:55:07,460 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:55:07,584 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 04:55:07,584 INFO L272 AbstractInterpreter]: Visited 26 different actions 51 times. Merged at 4 different actions 20 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-11-07 04:55:07,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:07,594 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 04:55:07,708 INFO L227 lantSequenceWeakener]: Weakened 27 states. On average, predicates are now at 63.02% of their original sizes. [2018-11-07 04:55:07,708 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 04:55:08,333 INFO L415 sIntCurrentIteration]: We unified 44 AI predicates to 44 [2018-11-07 04:55:08,333 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 04:55:08,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 04:55:08,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-11-07 04:55:08,334 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:55:08,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 04:55:08,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 04:55:08,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-07 04:55:08,336 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 10 states. [2018-11-07 04:55:10,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:10,205 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-11-07 04:55:10,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 04:55:10,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-07 04:55:10,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:10,208 INFO L225 Difference]: With dead ends: 109 [2018-11-07 04:55:10,208 INFO L226 Difference]: Without dead ends: 79 [2018-11-07 04:55:10,209 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-07 04:55:10,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-07 04:55:10,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 56. [2018-11-07 04:55:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 04:55:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-07 04:55:10,223 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 45 [2018-11-07 04:55:10,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:10,224 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-07 04:55:10,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 04:55:10,224 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-07 04:55:10,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-07 04:55:10,226 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:10,226 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 04:55:10,226 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:10,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:10,227 INFO L82 PathProgramCache]: Analyzing trace with hash -735946969, now seen corresponding path program 1 times [2018-11-07 04:55:10,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:10,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:10,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:10,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:10,229 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:10,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 04:55:10,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:10,299 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:10,300 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-11-07 04:55:10,300 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [12], [16], [19], [21], [25], [28], [30], [31], [32], [35], [39], [43], [44], [45], [46], [47], [48], [50], [54], [55], [56], [60], [63], [65], [66], [68], [73], [77], [82], [83], [94], [97], [99], [105], [106], [107], [109], [110], [111] [2018-11-07 04:55:10,303 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:55:10,303 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:55:10,910 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:55:10,910 INFO L272 AbstractInterpreter]: Visited 48 different actions 197 times. Merged at 20 different actions 126 times. Widened at 4 different actions 11 times. Found 10 fixpoints after 5 different actions. Largest state had 26 variables. [2018-11-07 04:55:10,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:10,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:55:10,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:10,954 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:55:10,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:10,971 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:55:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:11,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 04:55:11,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 04:55:11,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:11,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 04:55:11,425 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:11,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 04:55:11,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 04:55:11,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:55:11,426 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 4 states. [2018-11-07 04:55:11,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:11,698 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-11-07 04:55:11,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 04:55:11,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-11-07 04:55:11,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:11,700 INFO L225 Difference]: With dead ends: 98 [2018-11-07 04:55:11,700 INFO L226 Difference]: Without dead ends: 62 [2018-11-07 04:55:11,706 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:55:11,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-07 04:55:11,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-07 04:55:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 04:55:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-07 04:55:11,732 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 51 [2018-11-07 04:55:11,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:11,733 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-07 04:55:11,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 04:55:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-07 04:55:11,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-07 04:55:11,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:11,738 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:11,738 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:11,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:11,739 INFO L82 PathProgramCache]: Analyzing trace with hash -310563840, now seen corresponding path program 2 times [2018-11-07 04:55:11,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:11,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:11,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:11,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:11,740 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:11,885 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 04:55:11,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:11,886 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:11,886 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:11,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:11,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:11,887 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:55:11,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:55:11,901 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:55:11,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 04:55:11,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:55:11,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 04:55:12,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:12,174 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-07 04:55:12,956 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 04:55:12,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:12,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2018-11-07 04:55:12,987 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:12,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 04:55:12,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 04:55:12,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-07 04:55:12,988 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 8 states. [2018-11-07 04:55:13,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:13,295 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2018-11-07 04:55:13,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 04:55:13,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-11-07 04:55:13,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:13,296 INFO L225 Difference]: With dead ends: 130 [2018-11-07 04:55:13,297 INFO L226 Difference]: Without dead ends: 94 [2018-11-07 04:55:13,297 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-07 04:55:13,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-07 04:55:13,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 79. [2018-11-07 04:55:13,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-07 04:55:13,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-11-07 04:55:13,312 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 55 [2018-11-07 04:55:13,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:13,313 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-11-07 04:55:13,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 04:55:13,313 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-11-07 04:55:13,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-07 04:55:13,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:13,315 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:13,315 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:13,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:13,316 INFO L82 PathProgramCache]: Analyzing trace with hash -893647280, now seen corresponding path program 3 times [2018-11-07 04:55:13,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:13,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:13,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:55:13,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:13,317 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-07 04:55:13,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:13,437 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:13,438 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:13,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:13,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:13,438 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-07 04:55:13,450 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:55:13,450 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:55:13,488 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:55:13,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:55:13,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:13,501 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-07 04:55:13,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-07 04:55:13,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:13,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2018-11-07 04:55:13,636 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:13,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 04:55:13,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 04:55:13,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:55:13,638 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 6 states. [2018-11-07 04:55:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:13,914 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2018-11-07 04:55:13,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 04:55:13,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-11-07 04:55:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:13,916 INFO L225 Difference]: With dead ends: 136 [2018-11-07 04:55:13,916 INFO L226 Difference]: Without dead ends: 85 [2018-11-07 04:55:13,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:55:13,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-07 04:55:13,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-11-07 04:55:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-07 04:55:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-11-07 04:55:13,930 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 70 [2018-11-07 04:55:13,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:13,930 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-11-07 04:55:13,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 04:55:13,931 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-11-07 04:55:13,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-07 04:55:13,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:13,932 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:13,933 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:13,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:13,933 INFO L82 PathProgramCache]: Analyzing trace with hash -858298153, now seen corresponding path program 4 times [2018-11-07 04:55:13,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:13,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:13,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:55:13,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:13,935 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:14,124 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-07 04:55:14,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:14,125 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:14,125 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:14,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:14,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:14,126 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-07 04:55:14,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:14,137 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:55:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:14,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:14,220 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-07 04:55:14,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:14,428 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-07 04:55:14,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:14,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-11-07 04:55:14,451 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:14,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 04:55:14,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 04:55:14,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:55:14,452 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 7 states. [2018-11-07 04:55:14,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:14,942 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2018-11-07 04:55:14,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 04:55:14,943 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-11-07 04:55:14,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:14,944 INFO L225 Difference]: With dead ends: 162 [2018-11-07 04:55:14,944 INFO L226 Difference]: Without dead ends: 111 [2018-11-07 04:55:14,949 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 145 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:55:14,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-07 04:55:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 87. [2018-11-07 04:55:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-07 04:55:14,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-11-07 04:55:14,963 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 74 [2018-11-07 04:55:14,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:14,963 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-11-07 04:55:14,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 04:55:14,964 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-11-07 04:55:14,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-07 04:55:14,965 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:14,965 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:14,965 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:14,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:14,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1243598882, now seen corresponding path program 5 times [2018-11-07 04:55:14,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:14,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:14,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:14,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:14,967 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-07 04:55:15,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:15,173 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:15,173 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:15,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:15,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:15,174 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-07 04:55:15,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:55:15,187 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:55:15,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 04:55:15,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:55:15,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-07 04:55:15,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-07 04:55:15,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:15,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 15 [2018-11-07 04:55:15,491 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:15,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 04:55:15,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 04:55:15,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-11-07 04:55:15,492 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 11 states. [2018-11-07 04:55:15,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:15,876 INFO L93 Difference]: Finished difference Result 164 states and 181 transitions. [2018-11-07 04:55:15,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 04:55:15,876 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2018-11-07 04:55:15,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:15,878 INFO L225 Difference]: With dead ends: 164 [2018-11-07 04:55:15,879 INFO L226 Difference]: Without dead ends: 125 [2018-11-07 04:55:15,880 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2018-11-07 04:55:15,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-07 04:55:15,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2018-11-07 04:55:15,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-07 04:55:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-11-07 04:55:15,893 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 78 [2018-11-07 04:55:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:15,894 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-11-07 04:55:15,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 04:55:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-11-07 04:55:15,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-07 04:55:15,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:15,896 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-07 04:55:15,896 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:15,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:15,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1357170623, now seen corresponding path program 6 times [2018-11-07 04:55:15,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:15,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:15,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:55:15,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:15,898 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:16,154 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-07 04:55:16,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:55:16,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 04:55:16,155 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:55:16,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 04:55:16,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 04:55:16,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 04:55:16,156 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 5 states. [2018-11-07 04:55:16,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:16,825 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2018-11-07 04:55:16,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 04:55:16,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-11-07 04:55:16,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:16,830 INFO L225 Difference]: With dead ends: 170 [2018-11-07 04:55:16,830 INFO L226 Difference]: Without dead ends: 131 [2018-11-07 04:55:16,831 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:55:16,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-07 04:55:16,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 121. [2018-11-07 04:55:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-07 04:55:16,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2018-11-07 04:55:16,854 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 95 [2018-11-07 04:55:16,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:16,855 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2018-11-07 04:55:16,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 04:55:16,855 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2018-11-07 04:55:16,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-07 04:55:16,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:16,857 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:16,857 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:16,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:16,857 INFO L82 PathProgramCache]: Analyzing trace with hash -2060814037, now seen corresponding path program 7 times [2018-11-07 04:55:16,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:16,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:16,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:55:16,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:16,859 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-07 04:55:17,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:17,317 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:17,317 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:17,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:17,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:17,317 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-07 04:55:17,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:17,327 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:55:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:17,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-07 04:55:17,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-07 04:55:17,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:17,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 18 [2018-11-07 04:55:17,611 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:17,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 04:55:17,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 04:55:17,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-11-07 04:55:17,613 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 13 states. [2018-11-07 04:55:17,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:17,935 INFO L93 Difference]: Finished difference Result 198 states and 217 transitions. [2018-11-07 04:55:17,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 04:55:17,936 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 101 [2018-11-07 04:55:17,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:17,937 INFO L225 Difference]: With dead ends: 198 [2018-11-07 04:55:17,937 INFO L226 Difference]: Without dead ends: 131 [2018-11-07 04:55:17,938 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2018-11-07 04:55:17,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-07 04:55:17,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2018-11-07 04:55:17,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-07 04:55:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2018-11-07 04:55:17,950 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 101 [2018-11-07 04:55:17,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:17,950 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2018-11-07 04:55:17,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 04:55:17,950 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2018-11-07 04:55:17,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 04:55:17,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:17,951 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:17,951 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:17,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:17,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2079477055, now seen corresponding path program 8 times [2018-11-07 04:55:17,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:17,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:17,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:17,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:17,953 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 46 proven. 44 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-07 04:55:18,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:18,114 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:18,114 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:18,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:18,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:18,115 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:55:18,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:55:18,123 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:55:18,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 04:55:18,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:55:18,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:18,728 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 04:55:18,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:18,925 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-07 04:55:18,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:18,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 20 [2018-11-07 04:55:18,947 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:18,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 04:55:18,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 04:55:18,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2018-11-07 04:55:18,949 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand 14 states. [2018-11-07 04:55:20,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:20,115 INFO L93 Difference]: Finished difference Result 316 states and 362 transitions. [2018-11-07 04:55:20,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-07 04:55:20,116 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2018-11-07 04:55:20,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:20,118 INFO L225 Difference]: With dead ends: 316 [2018-11-07 04:55:20,118 INFO L226 Difference]: Without dead ends: 266 [2018-11-07 04:55:20,120 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 209 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=756, Invalid=1896, Unknown=0, NotChecked=0, Total=2652 [2018-11-07 04:55:20,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-07 04:55:20,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 187. [2018-11-07 04:55:20,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-07 04:55:20,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 207 transitions. [2018-11-07 04:55:20,139 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 207 transitions. Word has length 107 [2018-11-07 04:55:20,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:20,139 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 207 transitions. [2018-11-07 04:55:20,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 04:55:20,140 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 207 transitions. [2018-11-07 04:55:20,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-07 04:55:20,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:20,141 INFO L375 BasicCegarLoop]: trace histogram [12, 8, 8, 8, 8, 8, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:20,142 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:20,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:20,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1662210968, now seen corresponding path program 9 times [2018-11-07 04:55:20,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:20,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:20,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:55:20,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:20,143 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-11-07 04:55:20,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:20,284 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:20,284 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:20,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:20,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:20,285 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:55:20,293 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:55:20,294 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:55:20,344 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:55:20,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:55:20,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 132 proven. 24 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-07 04:55:20,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:20,728 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 132 proven. 24 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-07 04:55:20,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:20,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 17 [2018-11-07 04:55:20,751 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:20,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 04:55:20,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 04:55:20,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-11-07 04:55:20,752 INFO L87 Difference]: Start difference. First operand 187 states and 207 transitions. Second operand 11 states. [2018-11-07 04:55:21,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:21,044 INFO L93 Difference]: Finished difference Result 324 states and 362 transitions. [2018-11-07 04:55:21,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 04:55:21,048 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 142 [2018-11-07 04:55:21,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:21,050 INFO L225 Difference]: With dead ends: 324 [2018-11-07 04:55:21,050 INFO L226 Difference]: Without dead ends: 197 [2018-11-07 04:55:21,051 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 276 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2018-11-07 04:55:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-07 04:55:21,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 193. [2018-11-07 04:55:21,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-07 04:55:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 213 transitions. [2018-11-07 04:55:21,070 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 213 transitions. Word has length 142 [2018-11-07 04:55:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:21,070 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 213 transitions. [2018-11-07 04:55:21,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 04:55:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 213 transitions. [2018-11-07 04:55:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-07 04:55:21,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:21,072 INFO L375 BasicCegarLoop]: trace histogram [14, 9, 9, 9, 9, 9, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:21,073 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:21,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:21,073 INFO L82 PathProgramCache]: Analyzing trace with hash -800280201, now seen corresponding path program 10 times [2018-11-07 04:55:21,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:21,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:21,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:55:21,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:21,075 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 307 proven. 30 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2018-11-07 04:55:21,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:21,236 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:21,236 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:21,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:21,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:21,237 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:55:21,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:21,246 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:55:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:21,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 212 proven. 74 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 04:55:21,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 212 proven. 74 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-07 04:55:21,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:21,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 21 [2018-11-07 04:55:21,678 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:21,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 04:55:21,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 04:55:21,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-11-07 04:55:21,679 INFO L87 Difference]: Start difference. First operand 193 states and 213 transitions. Second operand 15 states. [2018-11-07 04:55:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:22,519 INFO L93 Difference]: Finished difference Result 326 states and 363 transitions. [2018-11-07 04:55:22,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 04:55:22,519 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 159 [2018-11-07 04:55:22,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:22,521 INFO L225 Difference]: With dead ends: 326 [2018-11-07 04:55:22,521 INFO L226 Difference]: Without dead ends: 222 [2018-11-07 04:55:22,522 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 316 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=1130, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 04:55:22,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-07 04:55:22,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 210. [2018-11-07 04:55:22,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-07 04:55:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 230 transitions. [2018-11-07 04:55:22,541 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 230 transitions. Word has length 159 [2018-11-07 04:55:22,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:22,541 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 230 transitions. [2018-11-07 04:55:22,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 04:55:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 230 transitions. [2018-11-07 04:55:22,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-07 04:55:22,543 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:22,544 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:22,544 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:22,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:22,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1318567839, now seen corresponding path program 11 times [2018-11-07 04:55:22,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:22,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:22,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:22,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:22,546 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:23,515 WARN L179 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2018-11-07 04:55:23,792 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-11-07 04:55:23,999 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-11-07 04:55:24,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:24,000 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:24,000 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:24,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:24,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:24,000 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:55:24,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:55:24,009 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:55:24,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 04:55:24,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:55:24,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:24,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-11-07 04:55:24,766 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:24,768 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:24,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 55 [2018-11-07 04:55:24,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:24,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:24,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:24,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:42 [2018-11-07 04:55:24,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-07 04:55:24,927 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:24,928 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:24,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-07 04:55:24,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:24,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:24,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 04:55:24,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2018-11-07 04:55:25,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-11-07 04:55:25,574 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:25,584 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:25,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 111 [2018-11-07 04:55:25,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2018-11-07 04:55:25,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-07 04:55:25,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-07 04:55:25,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:126 [2018-11-07 04:55:26,004 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-07 04:55:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 274 proven. 47 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-11-07 04:55:26,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:28,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 60 [2018-11-07 04:55:29,119 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-11-07 04:55:29,124 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 04:55:29,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:29,128 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 04:55:29,129 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:29,135 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:29,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:29,136 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:29,137 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:29,138 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:29,139 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:29,140 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:29,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 109 [2018-11-07 04:55:29,143 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:29,149 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:29,150 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:29,151 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:29,151 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:29,152 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:29,152 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:29,153 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:29,153 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:29,154 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:29,155 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:29,157 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:29,158 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:29,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 154 [2018-11-07 04:55:29,162 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:29,172 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 04:55:29,173 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:29,174 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 04:55:29,175 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:29,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:29,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:29,229 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:103, output treesize:40 [2018-11-07 04:55:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 252 proven. 69 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-11-07 04:55:29,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:29,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 27, 26] total 65 [2018-11-07 04:55:29,447 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:29,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-07 04:55:29,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-07 04:55:29,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=3763, Unknown=0, NotChecked=0, Total=4160 [2018-11-07 04:55:29,450 INFO L87 Difference]: Start difference. First operand 210 states and 230 transitions. Second operand 41 states. [2018-11-07 04:55:31,285 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2018-11-07 04:55:31,456 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2018-11-07 04:55:32,228 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2018-11-07 04:55:34,784 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2018-11-07 04:55:36,030 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2018-11-07 04:55:37,142 WARN L179 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-07 04:55:38,510 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2018-11-07 04:55:38,920 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2018-11-07 04:55:39,329 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2018-11-07 04:55:39,536 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2018-11-07 04:55:40,068 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-11-07 04:55:40,477 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-11-07 04:55:42,742 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2018-11-07 04:55:45,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:45,272 INFO L93 Difference]: Finished difference Result 1081 states and 1210 transitions. [2018-11-07 04:55:45,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-11-07 04:55:45,272 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 165 [2018-11-07 04:55:45,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:45,279 INFO L225 Difference]: With dead ends: 1081 [2018-11-07 04:55:45,280 INFO L226 Difference]: Without dead ends: 1029 [2018-11-07 04:55:45,289 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 290 SyntacticMatches, 2 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8348 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=3472, Invalid=25258, Unknown=0, NotChecked=0, Total=28730 [2018-11-07 04:55:45,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2018-11-07 04:55:45,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 540. [2018-11-07 04:55:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-11-07 04:55:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 621 transitions. [2018-11-07 04:55:45,398 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 621 transitions. Word has length 165 [2018-11-07 04:55:45,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:45,399 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 621 transitions. [2018-11-07 04:55:45,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-07 04:55:45,399 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 621 transitions. [2018-11-07 04:55:45,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-07 04:55:45,402 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:45,402 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 9, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-11-07 04:55:45,402 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:45,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:45,403 INFO L82 PathProgramCache]: Analyzing trace with hash 500946348, now seen corresponding path program 1 times [2018-11-07 04:55:45,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:45,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:45,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:55:45,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:45,404 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 1 proven. 284 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-11-07 04:55:46,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:46,456 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:46,456 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-07 04:55:46,456 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [12], [16], [19], [21], [25], [28], [30], [31], [32], [35], [37], [39], [43], [44], [45], [46], [47], [48], [50], [54], [55], [56], [60], [63], [65], [66], [68], [73], [77], [82], [83], [85], [87], [94], [97], [99], [102], [104], [105], [106], [107], [109], [110], [111], [112] [2018-11-07 04:55:46,459 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:55:46,459 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:55:47,201 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:55:47,201 INFO L272 AbstractInterpreter]: Visited 54 different actions 304 times. Merged at 27 different actions 185 times. Widened at 5 different actions 14 times. Found 21 fixpoints after 7 different actions. Largest state had 26 variables. [2018-11-07 04:55:47,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:47,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:55:47,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:47,238 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:55:47,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:47,258 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:55:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:47,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:48,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 59 [2018-11-07 04:55:48,242 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:48,243 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:48,244 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:48,245 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:48,246 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:48,249 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:48,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 140 [2018-11-07 04:55:48,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-07 04:55:48,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:48,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:48,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:49 [2018-11-07 04:55:48,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2018-11-07 04:55:48,420 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:48,422 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:48,424 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:48,425 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:48,426 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:48,427 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:48,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 140 [2018-11-07 04:55:48,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:48,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:48,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:48,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:53 [2018-11-07 04:55:48,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2018-11-07 04:55:48,749 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:48,750 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:48,751 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:48,751 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:48,752 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:48,753 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:48,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-11-07 04:55:48,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:48,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:48,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:48,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:9 [2018-11-07 04:55:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 191 proven. 215 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-11-07 04:55:48,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:58,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 80 [2018-11-07 04:55:58,470 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:58,470 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:58,470 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:58,476 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:58,477 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:58,478 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:58,482 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:58,485 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:58,499 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:58,500 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:58,500 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:58,510 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:58,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 80 treesize of output 262 [2018-11-07 04:55:58,556 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-07 04:55:58,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 27 xjuncts. [2018-11-07 04:55:58,695 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:58,711 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:58,822 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:58,831 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:58,844 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:58,909 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:58,949 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:59,105 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:59,118 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:59,131 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:59,232 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:59,232 INFO L303 Elim1Store]: Index analysis took 584 ms [2018-11-07 04:55:59,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 265 [2018-11-07 04:55:59,327 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-07 04:55:59,481 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 36 xjuncts. [2018-11-07 04:55:59,518 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:59,528 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:59,541 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:59,555 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:59,564 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:59,597 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:59,634 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:59,646 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:59,735 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:59,735 INFO L303 Elim1Store]: Index analysis took 253 ms [2018-11-07 04:55:59,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 169 [2018-11-07 04:55:59,804 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 04:55:59,839 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:59,852 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:59,869 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:59,878 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:59,891 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:59,900 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:59,913 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:59,947 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:59,989 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,022 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,035 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,055 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,088 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,142 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,146 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,146 INFO L303 Elim1Store]: Index analysis took 341 ms [2018-11-07 04:56:00,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 241 [2018-11-07 04:56:00,167 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2018-11-07 04:56:00,187 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,187 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,195 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,195 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,196 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,205 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,209 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,217 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,218 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,218 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,225 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 88 treesize of output 269 [2018-11-07 04:56:00,290 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-07 04:56:00,645 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 30 xjuncts. [2018-11-07 04:56:00,671 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,684 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,697 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,810 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,823 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,836 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,924 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:00,987 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:01,068 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:01,069 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:01,069 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:01,077 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:01,078 INFO L303 Elim1Store]: Index analysis took 432 ms [2018-11-07 04:56:01,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 83 treesize of output 266 [2018-11-07 04:56:01,137 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-07 04:56:01,270 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 23 xjuncts. [2018-11-07 04:56:01,297 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:01,306 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:01,310 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:01,310 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:01,311 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:01,312 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:01,312 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:01,314 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:01,316 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:01,333 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:01,341 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:01,342 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:01,343 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:01,343 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:01,345 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:01,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 154 [2018-11-07 04:56:01,347 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:02,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 04:56:02,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-07 04:56:02,060 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:94, output treesize:83 [2018-11-07 04:56:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 350 proven. 56 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-11-07 04:56:02,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:56:02,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 21] total 63 [2018-11-07 04:56:02,405 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:56:02,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-07 04:56:02,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-07 04:56:02,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=3648, Unknown=4, NotChecked=0, Total=3906 [2018-11-07 04:56:02,407 INFO L87 Difference]: Start difference. First operand 540 states and 621 transitions. Second operand 44 states. [2018-11-07 04:56:08,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:56:08,787 INFO L93 Difference]: Finished difference Result 907 states and 1048 transitions. [2018-11-07 04:56:08,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 04:56:08,788 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 175 [2018-11-07 04:56:08,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:56:08,792 INFO L225 Difference]: With dead ends: 907 [2018-11-07 04:56:08,792 INFO L226 Difference]: Without dead ends: 632 [2018-11-07 04:56:08,797 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 322 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2857 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=775, Invalid=9727, Unknown=4, NotChecked=0, Total=10506 [2018-11-07 04:56:08,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-11-07 04:56:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 580. [2018-11-07 04:56:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-11-07 04:56:08,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 666 transitions. [2018-11-07 04:56:08,877 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 666 transitions. Word has length 175 [2018-11-07 04:56:08,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:56:08,878 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 666 transitions. [2018-11-07 04:56:08,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-07 04:56:08,878 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 666 transitions. [2018-11-07 04:56:08,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-07 04:56:08,882 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:56:08,882 INFO L375 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 10, 9, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 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] [2018-11-07 04:56:08,883 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:56:08,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:56:08,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1646190659, now seen corresponding path program 2 times [2018-11-07 04:56:08,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:56:08,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:08,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:56:08,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:08,885 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:56:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:56:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 43 proven. 355 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-07 04:56:10,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:10,741 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:56:10,741 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:56:10,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:56:10,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:10,742 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:56:10,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:56:10,754 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:56:10,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 04:56:10,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:56:10,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:56:10,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-07 04:56:10,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:10,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:10,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-07 04:56:10,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-07 04:56:10,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-07 04:56:10,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:10,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:10,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:10,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-07 04:56:10,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-07 04:56:10,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:10,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-07 04:56:10,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-07 04:56:11,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-07 04:56:11,053 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,055 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,056 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-11-07 04:56:11,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-11-07 04:56:11,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-11-07 04:56:11,128 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,128 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,129 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,130 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,130 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,131 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-11-07 04:56:11,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-11-07 04:56:11,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-11-07 04:56:11,215 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,216 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,218 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,220 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,225 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,226 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,227 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,227 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 116 [2018-11-07 04:56:11,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-11-07 04:56:11,387 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,388 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:11,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-07 04:56:11,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:54 [2018-11-07 04:56:11,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2018-11-07 04:56:11,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-07 04:56:11,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 04:56:11,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:65 [2018-11-07 04:56:11,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-11-07 04:56:11,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-07 04:56:11,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-07 04:56:11,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-11-07 04:56:11,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-11-07 04:56:11,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-07 04:56:11,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-07 04:56:11,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-11-07 04:56:11,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-11-07 04:56:11,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-07 04:56:11,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:11,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-07 04:56:11,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:76 [2018-11-07 04:56:12,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-11-07 04:56:12,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-07 04:56:12,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:12,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:12,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-07 04:56:12,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:80, output treesize:76 [2018-11-07 04:56:18,179 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 45 [2018-11-07 04:56:18,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2018-11-07 04:56:18,218 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:18,218 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:18,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:18,220 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:18,221 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:18,222 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:18,223 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:18,224 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:18,225 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:18,226 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:18,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 76 [2018-11-07 04:56:18,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:18,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2018-11-07 04:56:18,258 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:18,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:18,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:18,265 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:79, output treesize:10 [2018-11-07 04:56:18,926 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 38 proven. 79 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2018-11-07 04:56:18,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:56:19,054 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-07 04:56:41,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 95 [2018-11-07 04:56:41,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 82 [2018-11-07 04:56:41,203 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 80 [2018-11-07 04:56:41,207 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,207 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,208 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 89 [2018-11-07 04:56:41,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:41,225 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:41,237 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:41,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2018-11-07 04:56:41,257 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,258 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,259 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 106 [2018-11-07 04:56:41,663 WARN L179 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 91 [2018-11-07 04:56:41,666 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,667 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,667 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,667 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2018-11-07 04:56:41,669 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:41,808 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,809 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,809 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-11-07 04:56:41,813 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:41,816 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,816 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,816 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,817 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-11-07 04:56:41,818 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:41,924 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,924 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,926 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:41,926 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,927 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:41,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-11-07 04:56:41,928 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:42,015 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:42,016 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:42,017 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:42,017 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:42,018 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:42,019 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:42,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 54 [2018-11-07 04:56:42,024 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:42,026 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:42,027 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:42,027 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:42,028 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:42,028 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:42,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 63 [2018-11-07 04:56:42,040 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-07 04:56:42,111 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-07 04:56:42,150 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 04:56:42,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-07 04:56:42,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:42,244 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:132, output treesize:6 [2018-11-07 04:56:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 67 proven. 54 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2018-11-07 04:56:50,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:56:50,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 19, 17] total 63 [2018-11-07 04:56:50,447 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:56:50,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-07 04:56:50,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-07 04:56:50,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=3565, Unknown=14, NotChecked=0, Total=3906 [2018-11-07 04:56:50,449 INFO L87 Difference]: Start difference. First operand 580 states and 666 transitions. Second operand 48 states. [2018-11-07 04:57:19,172 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 51 [2018-11-07 04:57:21,285 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 53 [2018-11-07 04:57:25,401 WARN L179 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2018-11-07 04:57:29,529 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-11-07 04:57:33,664 WARN L179 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2018-11-07 04:57:41,883 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 45 [2018-11-07 04:58:14,364 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 50 [2018-11-07 04:58:24,549 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2018-11-07 04:58:53,027 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2018-11-07 04:59:05,441 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 Received shutdown request... [2018-11-07 04:59:27,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 04:59:27,797 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 04:59:27,802 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 04:59:27,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:59:27 BoogieIcfgContainer [2018-11-07 04:59:27,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 04:59:27,812 INFO L168 Benchmark]: Toolchain (without parser) took 264745.77 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -443.1 MB). Peak memory consumption was 865.0 MB. Max. memory is 7.1 GB. [2018-11-07 04:59:27,812 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 04:59:27,813 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.41 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 04:59:27,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 04:59:27,813 INFO L168 Benchmark]: Boogie Preprocessor took 60.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 04:59:27,813 INFO L168 Benchmark]: RCFGBuilder took 643.95 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -754.1 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-07 04:59:27,814 INFO L168 Benchmark]: TraceAbstraction took 263623.60 ms. Allocated memory was 2.2 GB in the beginning and 2.8 GB in the end (delta: 590.3 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 300.5 MB). Peak memory consumption was 890.8 MB. Max. memory is 7.1 GB. [2018-11-07 04:59:27,818 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.25 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 375.41 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 31.09 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 643.95 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -754.1 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 263623.60 ms. Allocated memory was 2.2 GB in the beginning and 2.8 GB in the end (delta: 590.3 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 300.5 MB). Peak memory consumption was 890.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (580states) and FLOYD_HOARE automaton (currently 29 states, 48 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 83 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 56 locations, 1 error locations. TIMEOUT Result, 263.5s OverallTime, 17 OverallIterations, 15 TraceHistogramMax, 187.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 791 SDtfs, 3198 SDslu, 4202 SDs, 0 SdLazy, 6236 SolverSat, 921 SolverUnsat, 31 SolverUnknown, 0 SolverNotchecked, 72.6s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 3234 GetRequests, 2649 SyntacticMatches, 36 SemanticMatches, 548 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14431 ImplicationChecksByTransitivity, 169.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=580occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.0s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.9809503643354573 AbsIntWeakeningRatio, 0.5324675324675324 AbsIntAvgWeakeningVarsNumRemoved, 68.87012987012987 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 754 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 69.4s InterpolantComputationTime, 2956 NumberOfCodeBlocks, 2832 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 4277 ConstructedInterpolants, 97 QuantifiedInterpolants, 5104695 SizeOfPredicates, 68 NumberOfNonLiveVariables, 2536 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 41 InterpolantComputations, 3 PerfectInterpolantSequences, 6776/8900 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown