java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:17:52,311 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:17:52,314 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:17:52,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:17:52,328 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:17:52,330 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:17:52,331 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:17:52,333 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:17:52,335 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:17:52,335 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:17:52,336 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:17:52,337 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:17:52,338 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:17:52,339 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:17:52,343 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:17:52,345 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:17:52,346 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:17:52,348 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:17:52,355 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:17:52,357 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:17:52,363 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:17:52,364 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:17:52,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:17:52,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:17:52,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:17:52,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:17:52,374 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:17:52,375 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:17:52,376 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:17:52,377 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:17:52,377 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:17:52,378 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:17:52,381 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:17:52,381 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:17:52,382 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:17:52,383 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:17:52,383 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-24 12:17:52,409 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:17:52,409 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:17:52,410 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:17:52,410 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:17:52,410 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:17:52,411 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:17:52,411 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:17:52,411 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:17:52,411 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:17:52,411 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:17:52,412 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:17:52,412 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:17:52,413 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:17:52,413 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:17:52,413 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:17:52,413 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:17:52,414 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:17:52,414 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:17:52,414 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:17:52,414 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:17:52,415 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:17:52,415 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:17:52,415 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:17:52,415 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:17:52,415 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:17:52,416 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:17:52,416 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:17:52,416 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:17:52,416 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:17:52,416 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:17:52,417 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:17:52,417 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:17:52,417 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:17:52,417 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:17:52,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:17:52,475 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:17:52,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:17:52,481 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:17:52,481 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:17:52,482 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-10-24 12:17:52,545 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/129dbaf5f/0abd545f956e4b058194b206c3f4b423/FLAG9287b5605 [2018-10-24 12:17:53,018 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:17:53,019 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-10-24 12:17:53,028 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/129dbaf5f/0abd545f956e4b058194b206c3f4b423/FLAG9287b5605 [2018-10-24 12:17:53,049 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/129dbaf5f/0abd545f956e4b058194b206c3f4b423 [2018-10-24 12:17:53,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:17:53,065 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:17:53,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:17:53,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:17:53,070 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:17:53,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:17:53" (1/1) ... [2018-10-24 12:17:53,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b2e66ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:17:53, skipping insertion in model container [2018-10-24 12:17:53,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:17:53" (1/1) ... [2018-10-24 12:17:53,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:17:53,118 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:17:53,317 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:17:53,329 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:17:53,349 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:17:53,367 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:17:53,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:17:53 WrapperNode [2018-10-24 12:17:53,368 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:17:53,369 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:17:53,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:17:53,369 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:17:53,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:17:53" (1/1) ... [2018-10-24 12:17:53,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:17:53" (1/1) ... [2018-10-24 12:17:53,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:17:53,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:17:53,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:17:53,413 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:17:53,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:17:53" (1/1) ... [2018-10-24 12:17:53,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:17:53" (1/1) ... [2018-10-24 12:17:53,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:17:53" (1/1) ... [2018-10-24 12:17:53,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:17:53" (1/1) ... [2018-10-24 12:17:53,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:17:53" (1/1) ... [2018-10-24 12:17:53,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:17:53" (1/1) ... [2018-10-24 12:17:53,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:17:53" (1/1) ... [2018-10-24 12:17:53,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:17:53,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:17:53,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:17:53,441 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:17:53,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:17:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:17:53,594 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:17:53,594 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:17:53,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:17:53,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:17:53,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:17:53,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:17:53,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:17:53,595 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:17:54,083 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:17:54,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:17:54 BoogieIcfgContainer [2018-10-24 12:17:54,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:17:54,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:17:54,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:17:54,096 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:17:54,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:17:53" (1/3) ... [2018-10-24 12:17:54,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72817239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:17:54, skipping insertion in model container [2018-10-24 12:17:54,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:17:53" (2/3) ... [2018-10-24 12:17:54,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72817239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:17:54, skipping insertion in model container [2018-10-24 12:17:54,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:17:54" (3/3) ... [2018-10-24 12:17:54,100 INFO L112 eAbstractionObserver]: Analyzing ICFG mcmillan2006_true-unreach-call_true-termination.c.i [2018-10-24 12:17:54,110 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:17:54,118 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:17:54,137 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:17:54,176 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:17:54,177 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:17:54,177 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:17:54,177 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:17:54,177 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:17:54,177 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:17:54,178 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:17:54,178 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:17:54,198 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-10-24 12:17:54,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-24 12:17:54,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:17:54,205 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:17:54,207 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:17:54,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:17:54,217 INFO L82 PathProgramCache]: Analyzing trace with hash 235483989, now seen corresponding path program 1 times [2018-10-24 12:17:54,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:17:54,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:17:54,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:17:54,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:17:54,271 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:17:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:17:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:17:54,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:17:54,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 12:17:54,370 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:17:54,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 12:17:54,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 12:17:54,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:17:54,394 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-10-24 12:17:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:17:54,417 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-10-24 12:17:54,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 12:17:54,419 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-10-24 12:17:54,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:17:54,428 INFO L225 Difference]: With dead ends: 44 [2018-10-24 12:17:54,429 INFO L226 Difference]: Without dead ends: 22 [2018-10-24 12:17:54,433 INFO L605 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-10-24 12:17:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-24 12:17:54,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-24 12:17:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-24 12:17:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-10-24 12:17:54,474 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2018-10-24 12:17:54,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:17:54,474 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-10-24 12:17:54,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 12:17:54,475 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-10-24 12:17:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-24 12:17:54,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:17:54,476 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:17:54,476 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:17:54,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:17:54,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1613839314, now seen corresponding path program 1 times [2018-10-24 12:17:54,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:17:54,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:17:54,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:17:54,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:17:54,479 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:17:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:17:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:17:54,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:17:54,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 12:17:54,641 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:17:54,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 12:17:54,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 12:17:54,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:17:54,644 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 5 states. [2018-10-24 12:17:54,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:17:54,791 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-10-24 12:17:54,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:17:54,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-10-24 12:17:54,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:17:54,793 INFO L225 Difference]: With dead ends: 39 [2018-10-24 12:17:54,793 INFO L226 Difference]: Without dead ends: 25 [2018-10-24 12:17:54,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 12:17:54,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-24 12:17:54,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-10-24 12:17:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-24 12:17:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-10-24 12:17:54,801 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 16 [2018-10-24 12:17:54,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:17:54,801 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-10-24 12:17:54,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 12:17:54,802 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-10-24 12:17:54,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-24 12:17:54,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:17:54,803 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:17:54,803 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:17:54,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:17:54,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1557204615, now seen corresponding path program 1 times [2018-10-24 12:17:54,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:17:54,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:17:54,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:17:54,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:17:54,805 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:17:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:17:55,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:17:55,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:17:55,277 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:17:55,278 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-10-24 12:17:55,280 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [16], [18], [20], [24], [28], [33], [43], [46], [48], [54], [55], [56], [58] [2018-10-24 12:17:55,332 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:17:55,332 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:17:56,314 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:17:56,315 INFO L272 AbstractInterpreter]: Visited 18 different actions 91 times. Merged at 7 different actions 48 times. Widened at 2 different actions 6 times. Found 1 fixpoints after 1 different actions. Largest state had 34 variables. [2018-10-24 12:17:56,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:17:56,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:17:56,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:17:56,333 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-24 12:17:56,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:17:56,347 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:17:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:17:56,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:17:56,530 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-10-24 12:17:56,541 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-10-24 12:17:56,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:17:56,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:17:56,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:17:56,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-24 12:17:56,731 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 15 treesize of output 11 [2018-10-24 12:17:56,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-10-24 12:17:56,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:17:56,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:17:56,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:17:56,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-24 12:17:56,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:17:56,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:17:57,000 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 14 treesize of output 12 [2018-10-24 12:17:57,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2018-10-24 12:17:57,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:17:57,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:17:57,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:17:57,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:5 [2018-10-24 12:17:57,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:17:57,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:17:57,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2018-10-24 12:17:57,092 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:17:57,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 12:17:57,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 12:17:57,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-10-24 12:17:57,094 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2018-10-24 12:17:57,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:17:57,551 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-10-24 12:17:57,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 12:17:57,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-10-24 12:17:57,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:17:57,554 INFO L225 Difference]: With dead ends: 36 [2018-10-24 12:17:57,554 INFO L226 Difference]: Without dead ends: 34 [2018-10-24 12:17:57,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-10-24 12:17:57,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-24 12:17:57,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-10-24 12:17:57,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-24 12:17:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-10-24 12:17:57,563 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 19 [2018-10-24 12:17:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:17:57,564 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-10-24 12:17:57,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 12:17:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-10-24 12:17:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-24 12:17:57,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:17:57,565 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:17:57,566 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:17:57,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:17:57,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1892261924, now seen corresponding path program 1 times [2018-10-24 12:17:57,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:17:57,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:17:57,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:17:57,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:17:57,568 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:17:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:17:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:17:57,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:17:57,693 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:17:57,693 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-10-24 12:17:57,693 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [16], [18], [20], [24], [28], [33], [35], [37], [43], [46], [48], [51], [53], [54], [55], [56], [58], [59] [2018-10-24 12:17:57,696 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-24 12:17:57,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:17:58,627 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:17:58,628 INFO L272 AbstractInterpreter]: Visited 23 different actions 194 times. Merged at 10 different actions 92 times. Widened at 3 different actions 12 times. Found 8 fixpoints after 3 different actions. Largest state had 35 variables. [2018-10-24 12:17:58,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:17:58,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:17:58,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:17:58,666 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:17:58,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:17:58,679 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:17:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:17:58,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:17:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:17:58,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:17:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:17:58,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:17:58,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2018-10-24 12:17:58,948 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:17:58,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 12:17:58,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 12:17:58,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-10-24 12:17:58,951 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 10 states. [2018-10-24 12:17:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:17:59,086 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-10-24 12:17:59,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:17:59,088 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-10-24 12:17:59,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:17:59,091 INFO L225 Difference]: With dead ends: 54 [2018-10-24 12:17:59,091 INFO L226 Difference]: Without dead ends: 35 [2018-10-24 12:17:59,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-10-24 12:17:59,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-24 12:17:59,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-10-24 12:17:59,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-24 12:17:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-10-24 12:17:59,102 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 28 [2018-10-24 12:17:59,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:17:59,103 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-10-24 12:17:59,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 12:17:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-10-24 12:17:59,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-24 12:17:59,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:17:59,104 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:17:59,104 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:17:59,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:17:59,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2043007747, now seen corresponding path program 2 times [2018-10-24 12:17:59,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:17:59,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:17:59,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:17:59,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:17:59,106 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:17:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:17:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:17:59,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:17:59,367 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:17:59,367 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:17:59,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:17:59,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:17:59,368 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:17:59,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:17:59,379 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:17:59,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-24 12:17:59,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:17:59,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:17:59,570 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 13 treesize of output 10 [2018-10-24 12:17:59,585 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 10 treesize of output 9 [2018-10-24 12:17:59,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:17:59,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:17:59,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:17:59,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-24 12:17:59,785 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 15 treesize of output 11 [2018-10-24 12:17:59,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-10-24 12:17:59,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:17:59,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:17:59,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:17:59,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-24 12:17:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:17:59,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:17:59,974 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 16 treesize of output 14 [2018-10-24 12:17:59,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-10-24 12:17:59,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:17:59,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:17:59,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:17:59,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:5 [2018-10-24 12:18:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:18:00,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:18:00,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 20 [2018-10-24 12:18:00,041 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:18:00,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-24 12:18:00,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-24 12:18:00,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-10-24 12:18:00,043 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 19 states. [2018-10-24 12:18:00,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:18:00,555 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-10-24 12:18:00,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-24 12:18:00,556 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2018-10-24 12:18:00,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:18:00,557 INFO L225 Difference]: With dead ends: 48 [2018-10-24 12:18:00,557 INFO L226 Difference]: Without dead ends: 46 [2018-10-24 12:18:00,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2018-10-24 12:18:00,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-24 12:18:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-10-24 12:18:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-24 12:18:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-10-24 12:18:00,566 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 31 [2018-10-24 12:18:00,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:18:00,566 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-10-24 12:18:00,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-24 12:18:00,567 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-10-24 12:18:00,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-24 12:18:00,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:18:00,568 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:18:00,570 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:18:00,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:18:00,570 INFO L82 PathProgramCache]: Analyzing trace with hash -43804270, now seen corresponding path program 3 times [2018-10-24 12:18:00,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:18:00,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:18:00,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:18:00,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:18:00,572 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:18:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:18:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:18:00,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:18:00,823 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:18:00,823 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:18:00,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:18:00,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:18:00,823 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:18:00,833 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:18:00,834 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:18:00,870 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:18:00,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:18:00,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:18:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:18:00,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:18:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:18:01,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:18:01,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2018-10-24 12:18:01,039 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:18:01,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 12:18:01,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 12:18:01,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-10-24 12:18:01,041 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 13 states. [2018-10-24 12:18:01,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:18:01,198 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-10-24 12:18:01,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 12:18:01,199 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-10-24 12:18:01,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:18:01,201 INFO L225 Difference]: With dead ends: 71 [2018-10-24 12:18:01,201 INFO L226 Difference]: Without dead ends: 47 [2018-10-24 12:18:01,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 71 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-10-24 12:18:01,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-24 12:18:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-10-24 12:18:01,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-24 12:18:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-10-24 12:18:01,209 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 40 [2018-10-24 12:18:01,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:18:01,209 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-10-24 12:18:01,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 12:18:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-10-24 12:18:01,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-24 12:18:01,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:18:01,211 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:18:01,211 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:18:01,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:18:01,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1152087495, now seen corresponding path program 4 times [2018-10-24 12:18:01,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:18:01,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:18:01,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:18:01,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:18:01,213 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:18:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:18:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-24 12:18:01,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:18:01,514 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:18:01,515 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:18:01,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:18:01,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:18:01,515 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:18:01,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:18:01,524 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:18:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:18:01,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:18:01,610 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 15 treesize of output 12 [2018-10-24 12:18:01,625 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-10-24 12:18:01,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:18:01,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:18:01,650 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-10-24 12:18:01,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-10-24 12:18:09,824 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 21 treesize of output 17 [2018-10-24 12:18:09,850 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:18:09,851 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 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-24 12:18:09,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:18:09,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:18:09,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:18:09,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2018-10-24 12:18:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:18:09,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:18:11,613 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 15 treesize of output 13 [2018-10-24 12:18:11,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 10 treesize of output 3 [2018-10-24 12:18:11,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:18:11,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:18:11,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:18:11,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-10-24 12:18:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:18:11,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:18:11,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 19 [2018-10-24 12:18:11,710 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:18:11,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-24 12:18:11,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-24 12:18:11,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=292, Unknown=3, NotChecked=0, Total=342 [2018-10-24 12:18:11,712 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 18 states. [2018-10-24 12:18:16,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:18:16,341 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-10-24 12:18:16,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-24 12:18:16,341 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-10-24 12:18:16,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:18:16,343 INFO L225 Difference]: With dead ends: 60 [2018-10-24 12:18:16,343 INFO L226 Difference]: Without dead ends: 58 [2018-10-24 12:18:16,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 69 SyntacticMatches, 17 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=108, Invalid=645, Unknown=3, NotChecked=0, Total=756 [2018-10-24 12:18:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-24 12:18:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2018-10-24 12:18:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-24 12:18:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-10-24 12:18:16,353 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 43 [2018-10-24 12:18:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:18:16,354 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-10-24 12:18:16,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-24 12:18:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-10-24 12:18:16,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-24 12:18:16,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:18:16,355 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:18:16,356 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:18:16,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:18:16,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1561288932, now seen corresponding path program 5 times [2018-10-24 12:18:16,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:18:16,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:18:16,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:18:16,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:18:16,358 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:18:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:18:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 12:18:16,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:18:16,692 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:18:16,692 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:18:16,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:18:16,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:18:16,693 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:18:16,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:18:16,701 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:18:16,735 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-24 12:18:16,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:18:16,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:18:17,040 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 12:18:17,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:18:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 12:18:17,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:18:17,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2018-10-24 12:18:17,137 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:18:17,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-24 12:18:17,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-24 12:18:17,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-10-24 12:18:17,138 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 16 states. [2018-10-24 12:18:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:18:17,376 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-10-24 12:18:17,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 12:18:17,376 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-10-24 12:18:17,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:18:17,378 INFO L225 Difference]: With dead ends: 88 [2018-10-24 12:18:17,378 INFO L226 Difference]: Without dead ends: 59 [2018-10-24 12:18:17,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2018-10-24 12:18:17,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-24 12:18:17,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-10-24 12:18:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-24 12:18:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-10-24 12:18:17,388 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 52 [2018-10-24 12:18:17,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:18:17,388 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-10-24 12:18:17,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-24 12:18:17,388 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-10-24 12:18:17,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-24 12:18:17,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:18:17,389 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:18:17,390 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:18:17,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:18:17,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1718799683, now seen corresponding path program 6 times [2018-10-24 12:18:17,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:18:17,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:18:17,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:18:17,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:18:17,391 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:18:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:18:17,711 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 5 proven. 57 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 12:18:17,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:18:17,711 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:18:17,711 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:18:17,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:18:17,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:18:17,712 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 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-10-24 12:18:17,719 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:18:17,719 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:18:17,752 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:18:17,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:18:17,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:18:17,798 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 15 treesize of output 12 [2018-10-24 12:18:17,800 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-10-24 12:18:17,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:18:17,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:18:17,812 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-10-24 12:18:17,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-10-24 12:18:36,358 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 21 treesize of output 17 [2018-10-24 12:18:36,383 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:18:36,384 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 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-24 12:18:36,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:18:36,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:18:36,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:18:36,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2018-10-24 12:18:36,445 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 12:18:36,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:18:38,655 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 18 treesize of output 16 [2018-10-24 12:18:38,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 treesize of output 3 [2018-10-24 12:18:38,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:18:38,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:18:38,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:18:38,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2018-10-24 12:18:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-24 12:18:38,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:18:38,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 22 [2018-10-24 12:18:38,728 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:18:38,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-24 12:18:38,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-24 12:18:38,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=402, Unknown=4, NotChecked=0, Total=462 [2018-10-24 12:18:38,730 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 21 states. [2018-10-24 12:18:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:18:45,349 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-10-24 12:18:45,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-24 12:18:45,349 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-10-24 12:18:45,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:18:45,351 INFO L225 Difference]: With dead ends: 72 [2018-10-24 12:18:45,351 INFO L226 Difference]: Without dead ends: 70 [2018-10-24 12:18:45,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 89 SyntacticMatches, 20 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=125, Invalid=863, Unknown=4, NotChecked=0, Total=992 [2018-10-24 12:18:45,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-24 12:18:45,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-10-24 12:18:45,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-24 12:18:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-10-24 12:18:45,360 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 55 [2018-10-24 12:18:45,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:18:45,360 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-10-24 12:18:45,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-24 12:18:45,361 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-10-24 12:18:45,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-24 12:18:45,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:18:45,362 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:18:45,362 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:18:45,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:18:45,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1561077586, now seen corresponding path program 7 times [2018-10-24 12:18:45,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:18:45,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:18:45,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:18:45,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:18:45,364 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:18:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:18:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 43 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 12:18:45,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:18:45,516 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:18:45,516 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:18:45,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:18:45,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:18:45,516 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 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-10-24 12:18:45,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:18:45,531 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:18:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:18:45,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:18:45,692 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 50 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 12:18:45,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:18:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 50 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 12:18:45,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:18:45,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2018-10-24 12:18:45,850 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:18:45,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-24 12:18:45,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-24 12:18:45,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2018-10-24 12:18:45,851 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 19 states. [2018-10-24 12:18:46,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:18:46,052 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-10-24 12:18:46,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-24 12:18:46,055 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 64 [2018-10-24 12:18:46,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:18:46,056 INFO L225 Difference]: With dead ends: 105 [2018-10-24 12:18:46,056 INFO L226 Difference]: Without dead ends: 71 [2018-10-24 12:18:46,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 113 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2018-10-24 12:18:46,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-24 12:18:46,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-10-24 12:18:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-24 12:18:46,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-10-24 12:18:46,065 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 64 [2018-10-24 12:18:46,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:18:46,065 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-10-24 12:18:46,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-24 12:18:46,066 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-10-24 12:18:46,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-24 12:18:46,067 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:18:46,067 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:18:46,067 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:18:46,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:18:46,068 INFO L82 PathProgramCache]: Analyzing trace with hash -827370759, now seen corresponding path program 8 times [2018-10-24 12:18:46,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:18:46,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:18:46,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:18:46,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:18:46,069 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:18:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:18:47,023 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 7 proven. 92 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-24 12:18:47,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:18:47,024 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:18:47,024 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:18:47,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:18:47,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:18:47,024 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 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-10-24 12:18:47,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:18:47,031 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:18:47,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-24 12:18:47,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:18:47,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:18:47,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 15 treesize of output 12 [2018-10-24 12:18:47,237 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-10-24 12:18:47,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:18:47,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:18:47,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:18:47,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-10-24 12:18:49,105 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 23 treesize of output 19 [2018-10-24 12:18:49,109 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:18:49,110 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 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-24 12:18:49,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:18:49,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:18:49,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:18:49,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-10-24 12:18:49,189 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 38 proven. 52 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 12:18:49,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:18:49,810 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 18 treesize of output 16 [2018-10-24 12:18:49,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 treesize of output 3 [2018-10-24 12:18:49,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:18:49,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:18:49,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:18:49,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 [2018-10-24 12:18:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 38 proven. 52 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 12:18:49,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:18:49,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 18] total 41 [2018-10-24 12:18:49,944 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:18:49,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-24 12:18:49,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-24 12:18:49,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1452, Unknown=0, NotChecked=0, Total=1640 [2018-10-24 12:18:49,946 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 33 states. [2018-10-24 12:18:58,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:18:58,559 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-10-24 12:18:58,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-24 12:18:58,559 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 67 [2018-10-24 12:18:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:18:58,560 INFO L225 Difference]: With dead ends: 119 [2018-10-24 12:18:58,561 INFO L226 Difference]: Without dead ends: 85 [2018-10-24 12:18:58,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 99 SyntacticMatches, 15 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=590, Invalid=4960, Unknown=0, NotChecked=0, Total=5550 [2018-10-24 12:18:58,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-24 12:18:58,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-10-24 12:18:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-24 12:18:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-10-24 12:18:58,575 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 67 [2018-10-24 12:18:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:18:58,575 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-10-24 12:18:58,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-24 12:18:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-10-24 12:18:58,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-24 12:18:58,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:18:58,577 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:18:58,577 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:18:58,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:18:58,578 INFO L82 PathProgramCache]: Analyzing trace with hash -83912829, now seen corresponding path program 9 times [2018-10-24 12:18:58,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:18:58,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:18:58,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:18:58,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:18:58,579 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:18:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:18:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 9 proven. 135 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-24 12:18:59,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:18:59,017 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:18:59,017 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:18:59,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:18:59,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:18:59,018 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 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-10-24 12:18:59,027 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:18:59,027 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:18:59,089 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:18:59,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:18:59,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:18:59,123 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 15 treesize of output 12 [2018-10-24 12:18:59,125 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-10-24 12:18:59,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:18:59,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:18:59,141 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-10-24 12:18:59,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-10-24 12:19:49,838 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 19 treesize of output 15 [2018-10-24 12:19:49,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-10-24 12:19:49,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:19:49,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:19:49,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:19:49,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-24 12:19:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 12:19:49,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:19:52,112 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 16 treesize of output 14 [2018-10-24 12:19:52,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-10-24 12:19:52,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:19:52,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:19:52,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:19:52,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2018-10-24 12:19:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 10 proven. 122 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 12:19:52,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:19:52,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 28 [2018-10-24 12:19:52,170 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:19:52,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-24 12:19:52,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-24 12:19:52,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=676, Unknown=6, NotChecked=0, Total=756 [2018-10-24 12:19:52,171 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 27 states. [2018-10-24 12:20:03,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:20:03,350 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2018-10-24 12:20:03,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-24 12:20:03,350 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 79 [2018-10-24 12:20:03,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:20:03,352 INFO L225 Difference]: With dead ends: 96 [2018-10-24 12:20:03,352 INFO L226 Difference]: Without dead ends: 94 [2018-10-24 12:20:03,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 131 SyntacticMatches, 22 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 53.5s TimeCoverageRelationStatistics Valid=159, Invalid=1395, Unknown=6, NotChecked=0, Total=1560 [2018-10-24 12:20:03,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-24 12:20:03,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-10-24 12:20:03,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-24 12:20:03,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-10-24 12:20:03,366 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 79 [2018-10-24 12:20:03,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:20:03,366 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-10-24 12:20:03,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-24 12:20:03,367 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-10-24 12:20:03,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-24 12:20:03,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:20:03,368 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:20:03,369 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:20:03,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:20:03,369 INFO L82 PathProgramCache]: Analyzing trace with hash 731833618, now seen corresponding path program 10 times [2018-10-24 12:20:03,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:20:03,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:20:03,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:20:03,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:20:03,371 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:20:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:20:03,656 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 78 proven. 84 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-24 12:20:03,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:20:03,656 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:20:03,656 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:20:03,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:20:03,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:20:03,657 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 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-10-24 12:20:03,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:20:03,667 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:20:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:20:03,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:20:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 105 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-24 12:20:03,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:20:04,017 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 105 proven. 57 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-24 12:20:04,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:20:04,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 26 [2018-10-24 12:20:04,042 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:20:04,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-24 12:20:04,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-24 12:20:04,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2018-10-24 12:20:04,044 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 25 states. [2018-10-24 12:20:04,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:20:04,463 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-10-24 12:20:04,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-24 12:20:04,464 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-10-24 12:20:04,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:20:04,465 INFO L225 Difference]: With dead ends: 139 [2018-10-24 12:20:04,465 INFO L226 Difference]: Without dead ends: 95 [2018-10-24 12:20:04,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 155 SyntacticMatches, 13 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=268, Invalid=854, Unknown=0, NotChecked=0, Total=1122 [2018-10-24 12:20:04,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-24 12:20:04,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-10-24 12:20:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-24 12:20:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-10-24 12:20:04,479 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 88 [2018-10-24 12:20:04,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:20:04,480 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-10-24 12:20:04,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-24 12:20:04,480 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-10-24 12:20:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-24 12:20:04,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:20:04,482 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:20:04,482 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:20:04,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:20:04,483 INFO L82 PathProgramCache]: Analyzing trace with hash -55358535, now seen corresponding path program 11 times [2018-10-24 12:20:04,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:20:04,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:20:04,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:20:04,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:20:04,484 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:20:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:20:05,035 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 11 proven. 186 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-24 12:20:05,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:20:05,035 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:20:05,036 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:20:05,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:20:05,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:20:05,036 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 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-10-24 12:20:05,045 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:20:05,045 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:20:05,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-24 12:20:05,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:20:05,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:20:05,299 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 15 treesize of output 12 [2018-10-24 12:20:05,304 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-10-24 12:20:05,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:20:05,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:20:05,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:20:05,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-10-24 12:20:10,609 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 23 treesize of output 19 [2018-10-24 12:20:10,612 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:20:10,614 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 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-24 12:20:10,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:20:10,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:20:10,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:20:10,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-10-24 12:20:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 87 proven. 95 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-24 12:20:10,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:20:12,923 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 18 treesize of output 16 [2018-10-24 12:20:12,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 treesize of output 3 [2018-10-24 12:20:12,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:20:12,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:20:12,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:20:12,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:7 [2018-10-24 12:20:13,132 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 87 proven. 95 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-24 12:20:13,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:20:13,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 22] total 51 [2018-10-24 12:20:13,155 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:20:13,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-24 12:20:13,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-24 12:20:13,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=2269, Unknown=0, NotChecked=0, Total=2550 [2018-10-24 12:20:13,158 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 41 states. [2018-10-24 12:20:18,052 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-24 12:20:27,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:20:27,998 INFO L93 Difference]: Finished difference Result 153 states and 161 transitions. [2018-10-24 12:20:27,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-24 12:20:27,998 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 91 [2018-10-24 12:20:27,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:20:28,000 INFO L225 Difference]: With dead ends: 153 [2018-10-24 12:20:28,000 INFO L226 Difference]: Without dead ends: 109 [2018-10-24 12:20:28,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 135 SyntacticMatches, 21 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2049 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=868, Invalid=8252, Unknown=0, NotChecked=0, Total=9120 [2018-10-24 12:20:28,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-24 12:20:28,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-10-24 12:20:28,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-24 12:20:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2018-10-24 12:20:28,020 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 91 [2018-10-24 12:20:28,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:20:28,020 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2018-10-24 12:20:28,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-24 12:20:28,021 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2018-10-24 12:20:28,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-24 12:20:28,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:20:28,023 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:20:28,025 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:20:28,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:20:28,026 INFO L82 PathProgramCache]: Analyzing trace with hash 762851779, now seen corresponding path program 12 times [2018-10-24 12:20:28,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:20:28,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:20:28,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:20:28,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:20:28,027 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:20:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:20:28,717 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 13 proven. 245 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-24 12:20:28,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:20:28,718 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:20:28,718 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:20:28,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:20:28,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:20:28,719 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:20:28,733 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:20:28,733 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:20:28,823 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:20:28,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:20:28,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:20:29,267 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 15 treesize of output 12 [2018-10-24 12:20:29,276 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-10-24 12:20:29,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:20:29,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:20:29,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:20:29,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-10-24 12:20:36,835 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 23 treesize of output 19 [2018-10-24 12:20:36,837 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:20:36,837 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 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-24 12:20:36,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:20:36,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:20:36,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:20:36,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-10-24 12:20:36,966 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 38 proven. 202 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-24 12:20:36,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:20:38,544 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 18 treesize of output 16 [2018-10-24 12:20:38,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 9 treesize of output 3 [2018-10-24 12:20:38,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:20:38,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:20:38,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:20:38,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:7 [2018-10-24 12:20:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 119 proven. 121 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-10-24 12:20:38,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:20:38,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 24] total 56 [2018-10-24 12:20:38,957 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:20:38,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-24 12:20:38,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-24 12:20:38,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=2763, Unknown=0, NotChecked=0, Total=3080 [2018-10-24 12:20:38,962 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 42 states. [2018-10-24 12:21:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:21:12,499 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2018-10-24 12:21:12,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-24 12:21:12,499 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 103 [2018-10-24 12:21:12,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:21:12,501 INFO L225 Difference]: With dead ends: 166 [2018-10-24 12:21:12,501 INFO L226 Difference]: Without dead ends: 121 [2018-10-24 12:21:12,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 159 SyntacticMatches, 24 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2535 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=917, Invalid=10003, Unknown=0, NotChecked=0, Total=10920 [2018-10-24 12:21:12,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-24 12:21:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2018-10-24 12:21:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-24 12:21:12,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-10-24 12:21:12,518 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 103 [2018-10-24 12:21:12,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:21:12,518 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-10-24 12:21:12,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-24 12:21:12,519 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-10-24 12:21:12,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-24 12:21:12,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:21:12,520 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:21:12,520 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:21:12,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:21:12,521 INFO L82 PathProgramCache]: Analyzing trace with hash -808160135, now seen corresponding path program 13 times [2018-10-24 12:21:12,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:21:12,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:21:12,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:21:12,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:21:12,522 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:21:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:21:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 15 proven. 312 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-10-24 12:21:12,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:21:12,988 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:21:12,988 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:21:12,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:21:12,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:21:12,988 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:21:12,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:21:12,997 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:21:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:21:13,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:21:13,069 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 15 treesize of output 12 [2018-10-24 12:21:13,075 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-10-24 12:21:13,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:21:13,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:21:13,088 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-10-24 12:21:13,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 Received shutdown request... [2018-10-24 12:22:27,826 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-24 12:22:28,027 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:22:28,028 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 12:22:28,033 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 12:22:28,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:22:28 BoogieIcfgContainer [2018-10-24 12:22:28,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 12:22:28,034 INFO L168 Benchmark]: Toolchain (without parser) took 274970.80 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 991.4 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -384.2 MB). Peak memory consumption was 607.2 MB. Max. memory is 7.1 GB. [2018-10-24 12:22:28,035 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:22:28,035 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.22 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-10-24 12:22:28,036 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:22:28,036 INFO L168 Benchmark]: Boogie Preprocessor took 27.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 12:22:28,036 INFO L168 Benchmark]: RCFGBuilder took 643.61 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -792.2 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2018-10-24 12:22:28,037 INFO L168 Benchmark]: TraceAbstraction took 273941.55 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 245.4 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 397.5 MB). Peak memory consumption was 642.8 MB. Max. memory is 7.1 GB. [2018-10-24 12:22:28,040 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 302.22 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 43.89 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 27.01 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.61 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -792.2 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 273941.55 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 245.4 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 397.5 MB). Peak memory consumption was 642.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 6]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 6). Cancelled while BasicCegarLoop was analyzing trace of length 116 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. TIMEOUT Result, 273.8s OverallTime, 16 OverallIterations, 10 TraceHistogramMax, 81.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 446 SDtfs, 732 SDslu, 4380 SDs, 0 SdLazy, 5504 SolverSat, 527 SolverUnsat, 22 SolverUnknown, 0 SolverNotchecked, 57.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1926 GetRequests, 1244 SyntacticMatches, 168 SemanticMatches, 514 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7601 ImplicationChecksByTransitivity, 132.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.0s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 30 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 112.4s InterpolantComputationTime, 1551 NumberOfCodeBlocks, 1551 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 2270 ConstructedInterpolants, 309 QuantifiedInterpolants, 1143862 SizeOfPredicates, 161 NumberOfNonLiveVariables, 2811 ConjunctsInSsa, 369 ConjunctsInUnsatCore, 41 InterpolantComputations, 2 PerfectInterpolantSequences, 1937/4140 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown