java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 09:11:20,327 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 09:11:20,329 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 09:11:20,349 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 09:11:20,350 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 09:11:20,351 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 09:11:20,352 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 09:11:20,355 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 09:11:20,357 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 09:11:20,358 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 09:11:20,358 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 09:11:20,359 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 09:11:20,360 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 09:11:20,361 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 09:11:20,362 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 09:11:20,363 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 09:11:20,363 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 09:11:20,365 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 09:11:20,367 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 09:11:20,369 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 09:11:20,372 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 09:11:20,373 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 09:11:20,379 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 09:11:20,380 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 09:11:20,380 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 09:11:20,381 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 09:11:20,382 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 09:11:20,383 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 09:11:20,385 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 09:11:20,389 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 09:11:20,389 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 09:11:20,389 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 09:11:20,390 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 09:11:20,390 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 09:11:20,393 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 09:11:20,394 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 09:11:20,394 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-27 09:11:20,422 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 09:11:20,422 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 09:11:20,426 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 09:11:20,426 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 09:11:20,426 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 09:11:20,426 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 09:11:20,426 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 09:11:20,427 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 09:11:20,427 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 09:11:20,427 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 09:11:20,427 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 09:11:20,427 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 09:11:20,427 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 09:11:20,428 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 09:11:20,429 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 09:11:20,429 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 09:11:20,429 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 09:11:20,429 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 09:11:20,430 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 09:11:20,430 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 09:11:20,430 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 09:11:20,430 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 09:11:20,430 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 09:11:20,431 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 09:11:20,432 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 09:11:20,432 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 09:11:20,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 09:11:20,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 09:11:20,433 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 09:11:20,433 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 09:11:20,433 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 09:11:20,433 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 09:11:20,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 09:11:20,434 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 09:11:20,434 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 09:11:20,434 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 09:11:20,503 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 09:11:20,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 09:11:20,520 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 09:11:20,521 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 09:11:20,522 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 09:11:20,522 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i [2018-10-27 09:11:20,584 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7c51f1b53/657c7ba9c6224b5bb2b72cb643c0be96/FLAG54063b229 [2018-10-27 09:11:21,010 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 09:11:21,011 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i [2018-10-27 09:11:21,019 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7c51f1b53/657c7ba9c6224b5bb2b72cb643c0be96/FLAG54063b229 [2018-10-27 09:11:21,041 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7c51f1b53/657c7ba9c6224b5bb2b72cb643c0be96 [2018-10-27 09:11:21,054 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 09:11:21,057 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 09:11:21,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 09:11:21,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 09:11:21,063 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 09:11:21,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 09:11:21" (1/1) ... [2018-10-27 09:11:21,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a37ae9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:11:21, skipping insertion in model container [2018-10-27 09:11:21,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 09:11:21" (1/1) ... [2018-10-27 09:11:21,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 09:11:21,105 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 09:11:21,273 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 09:11:21,277 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 09:11:21,300 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 09:11:21,326 INFO L193 MainTranslator]: Completed translation [2018-10-27 09:11:21,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:11:21 WrapperNode [2018-10-27 09:11:21,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 09:11:21,327 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 09:11:21,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 09:11:21,328 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 09:11:21,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:11:21" (1/1) ... [2018-10-27 09:11:21,351 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:11:21" (1/1) ... [2018-10-27 09:11:21,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 09:11:21,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 09:11:21,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 09:11:21,376 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 09:11:21,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:11:21" (1/1) ... [2018-10-27 09:11:21,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:11:21" (1/1) ... [2018-10-27 09:11:21,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:11:21" (1/1) ... [2018-10-27 09:11:21,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:11:21" (1/1) ... [2018-10-27 09:11:21,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:11:21" (1/1) ... [2018-10-27 09:11:21,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:11:21" (1/1) ... [2018-10-27 09:11:21,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:11:21" (1/1) ... [2018-10-27 09:11:21,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 09:11:21,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 09:11:21,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 09:11:21,420 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 09:11:21,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:11:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 09:11:21,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 09:11:21,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 09:11:21,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 09:11:21,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 09:11:21,557 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 09:11:21,557 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 09:11:21,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 09:11:21,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 09:11:22,007 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 09:11:22,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 09:11:22 BoogieIcfgContainer [2018-10-27 09:11:22,007 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 09:11:22,008 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 09:11:22,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 09:11:22,012 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 09:11:22,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 09:11:21" (1/3) ... [2018-10-27 09:11:22,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640eda8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 09:11:22, skipping insertion in model container [2018-10-27 09:11:22,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:11:21" (2/3) ... [2018-10-27 09:11:22,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640eda8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 09:11:22, skipping insertion in model container [2018-10-27 09:11:22,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 09:11:22" (3/3) ... [2018-10-27 09:11:22,015 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call2_true-termination.i [2018-10-27 09:11:22,024 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 09:11:22,031 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 09:11:22,049 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 09:11:22,084 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 09:11:22,084 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 09:11:22,085 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 09:11:22,085 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 09:11:22,085 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 09:11:22,085 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 09:11:22,085 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 09:11:22,086 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 09:11:22,104 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-10-27 09:11:22,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-27 09:11:22,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:11:22,112 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:11:22,114 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:11:22,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:11:22,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1193744236, now seen corresponding path program 1 times [2018-10-27 09:11:22,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:11:22,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:11:22,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:11:22,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:11:22,173 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:11:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:11:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:11:22,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:11:22,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 09:11:22,270 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:11:22,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 09:11:22,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 09:11:22,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 09:11:22,292 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-10-27 09:11:22,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:11:22,324 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-10-27 09:11:22,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 09:11:22,325 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-10-27 09:11:22,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:11:22,333 INFO L225 Difference]: With dead ends: 43 [2018-10-27 09:11:22,333 INFO L226 Difference]: Without dead ends: 21 [2018-10-27 09:11:22,336 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-27 09:11:22,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-27 09:11:22,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-27 09:11:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-27 09:11:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-10-27 09:11:22,371 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2018-10-27 09:11:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:11:22,371 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-10-27 09:11:22,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 09:11:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-10-27 09:11:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 09:11:22,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:11:22,373 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:11:22,373 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:11:22,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:11:22,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1255135895, now seen corresponding path program 1 times [2018-10-27 09:11:22,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:11:22,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:11:22,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:11:22,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:11:22,376 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:11:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:11:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:11:22,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:11:22,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 09:11:22,508 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:11:22,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 09:11:22,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 09:11:22,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 09:11:22,512 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 3 states. [2018-10-27 09:11:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:11:22,607 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-10-27 09:11:22,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 09:11:22,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-27 09:11:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:11:22,610 INFO L225 Difference]: With dead ends: 41 [2018-10-27 09:11:22,610 INFO L226 Difference]: Without dead ends: 29 [2018-10-27 09:11:22,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 09:11:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-27 09:11:22,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-10-27 09:11:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-27 09:11:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-10-27 09:11:22,622 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2018-10-27 09:11:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:11:22,622 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-10-27 09:11:22,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 09:11:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-10-27 09:11:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-27 09:11:22,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:11:22,623 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:11:22,624 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:11:22,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:11:22,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1812131568, now seen corresponding path program 1 times [2018-10-27 09:11:22,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:11:22,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:11:22,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:11:22,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:11:22,626 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:11:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:11:22,786 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-27 09:11:22,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:11:22,786 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:11:22,788 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-10-27 09:11:22,790 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [29], [39], [42], [44], [50], [51], [52], [54] [2018-10-27 09:11:22,838 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:11:22,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:11:23,050 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:11:23,052 INFO L272 AbstractInterpreter]: Visited 17 different actions 25 times. Merged at 3 different actions 6 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-10-27 09:11:23,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:11:23,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:11:23,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:11:23,065 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:11:23,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:11:23,075 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:11:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:11:23,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:11:23,234 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-27 09:11:23,245 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-27 09:11:23,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:11:23,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:11:23,287 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-27 09:11:23,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-10-27 09:11:23,348 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-27 09:11:23,374 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:11:23,375 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-27 09:11:23,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:11:23,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:11:23,509 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-27 09:11:23,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:9 [2018-10-27 09:11:23,718 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-27 09:11:23,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:11:23,885 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-27 09:11:23,957 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-27 09:11:23,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:11:24,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:11:24,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 09:11:24,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:15 [2018-10-27 09:11:25,131 WARN L179 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 09:11:25,141 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-27 09:11:25,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:11:25,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 14 [2018-10-27 09:11:25,162 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:11:25,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 09:11:25,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 09:11:25,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-10-27 09:11:25,165 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2018-10-27 09:11:25,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:11:25,739 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-10-27 09:11:25,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 09:11:25,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-10-27 09:11:25,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:11:25,741 INFO L225 Difference]: With dead ends: 53 [2018-10-27 09:11:25,742 INFO L226 Difference]: Without dead ends: 41 [2018-10-27 09:11:25,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-10-27 09:11:25,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-27 09:11:25,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2018-10-27 09:11:25,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-27 09:11:25,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-10-27 09:11:25,751 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 18 [2018-10-27 09:11:25,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:11:25,751 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-10-27 09:11:25,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 09:11:25,751 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-10-27 09:11:25,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-27 09:11:25,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:11:25,753 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] [2018-10-27 09:11:25,753 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:11:25,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:11:25,753 INFO L82 PathProgramCache]: Analyzing trace with hash 602547482, now seen corresponding path program 1 times [2018-10-27 09:11:25,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:11:25,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:11:25,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:11:25,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:11:25,755 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:11:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:11:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 09:11:26,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:11:26,087 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:11:26,087 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-10-27 09:11:26,088 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [29], [31], [33], [39], [42], [44], [47], [49], [50], [51], [52], [54], [55] [2018-10-27 09:11:26,090 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:11:26,090 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:11:26,198 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:11:26,198 INFO L272 AbstractInterpreter]: Visited 22 different actions 52 times. Merged at 8 different actions 16 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 32 variables. [2018-10-27 09:11:26,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:11:26,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:11:26,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:11:26,238 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:11:26,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:11:26,252 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:11:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:11:26,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:11:26,398 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 17 treesize of output 14 [2018-10-27 09:11:26,418 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 14 treesize of output 13 [2018-10-27 09:11:26,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:11:26,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:11:26,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 09:11:26,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2018-10-27 09:11:27,173 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 31 treesize of output 27 [2018-10-27 09:11:27,178 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:11:27,179 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 27 treesize of output 23 [2018-10-27 09:11:27,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:11:30,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:11:30,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 09:11:30,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:34 [2018-10-27 09:11:32,417 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-27 09:11:32,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:11:34,808 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-10-27 09:11:37,561 WARN L179 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2018-10-27 09:11:37,813 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-10-27 09:11:37,878 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 20 treesize of output 18 [2018-10-27 09:11:37,916 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-10-27 09:11:37,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:11:37,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:11:37,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 09:11:37,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:15 [2018-10-27 09:11:38,295 WARN L179 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-27 09:11:39,156 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 09:11:39,166 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-27 09:11:39,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:11:39,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 13] total 25 [2018-10-27 09:11:39,188 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:11:39,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-27 09:11:39,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-27 09:11:39,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=515, Unknown=2, NotChecked=0, Total=600 [2018-10-27 09:11:39,190 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 14 states. [2018-10-27 09:11:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:11:52,491 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-10-27 09:11:52,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 09:11:52,491 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-10-27 09:11:52,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:11:52,492 INFO L225 Difference]: With dead ends: 67 [2018-10-27 09:11:52,493 INFO L226 Difference]: Without dead ends: 48 [2018-10-27 09:11:52,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=89, Invalid=559, Unknown=2, NotChecked=0, Total=650 [2018-10-27 09:11:52,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-27 09:11:52,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2018-10-27 09:11:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-27 09:11:52,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-10-27 09:11:52,502 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2018-10-27 09:11:52,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:11:52,502 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-10-27 09:11:52,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-27 09:11:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-10-27 09:11:52,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-27 09:11:52,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:11:52,504 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:11:52,504 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:11:52,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:11:52,504 INFO L82 PathProgramCache]: Analyzing trace with hash 500960641, now seen corresponding path program 2 times [2018-10-27 09:11:52,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:11:52,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:11:52,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:11:52,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:11:52,506 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:11:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:11:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 09:11:52,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:11:52,786 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:11:52,787 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:11:52,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:11:52,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:11:52,787 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-27 09:11:52,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:11:52,795 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:11:52,883 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 09:11:52,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:11:52,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:11:52,981 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 17 treesize of output 14 [2018-10-27 09:11:52,985 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 14 treesize of output 13 [2018-10-27 09:11:52,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:11:52,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:11:53,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 09:11:53,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2018-10-27 09:11:53,096 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 29 treesize of output 24 [2018-10-27 09:11:53,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 38 [2018-10-27 09:11:53,165 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 09:11:53,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:11:53,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 09:11:53,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:68, output treesize:61 [2018-10-27 09:11:54,219 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 31 treesize of output 27 [2018-10-27 09:11:54,224 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:11:54,225 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 27 treesize of output 23 [2018-10-27 09:11:54,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:11:54,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:11:55,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 09:11:55,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:34 [2018-10-27 09:11:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 09:11:57,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:12:00,260 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-10-27 09:12:02,403 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2018-10-27 09:12:04,502 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 32 [2018-10-27 09:12:20,987 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 21 [2018-10-27 09:12:20,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-10-27 09:12:21,015 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:12:21,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-10-27 09:12:21,020 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 09:12:21,022 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:12:21,023 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 09:12:21,032 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:12:21,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:12:21,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 09:12:21,094 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:48, output treesize:20 [2018-10-27 09:12:23,025 WARN L179 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 11 [2018-10-27 09:12:25,984 WARN L179 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 09:12:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:12:26,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:12:26,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 14] total 27 [2018-10-27 09:12:26,025 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:12:26,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 09:12:26,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 09:12:26,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=601, Unknown=10, NotChecked=0, Total=702 [2018-10-27 09:12:26,027 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 15 states. [2018-10-27 09:12:40,109 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 37 [2018-10-27 09:12:46,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:12:46,535 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-10-27 09:12:46,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 09:12:46,535 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-10-27 09:12:46,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:12:46,538 INFO L225 Difference]: With dead ends: 85 [2018-10-27 09:12:46,538 INFO L226 Difference]: Without dead ends: 66 [2018-10-27 09:12:46,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 36.1s TimeCoverageRelationStatistics Valid=147, Invalid=899, Unknown=10, NotChecked=0, Total=1056 [2018-10-27 09:12:46,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-27 09:12:46,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2018-10-27 09:12:46,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-27 09:12:46,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-10-27 09:12:46,552 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 33 [2018-10-27 09:12:46,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:12:46,552 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-10-27 09:12:46,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 09:12:46,553 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-10-27 09:12:46,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 09:12:46,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:12:46,554 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:12:46,555 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:12:46,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:12:46,555 INFO L82 PathProgramCache]: Analyzing trace with hash -207301449, now seen corresponding path program 3 times [2018-10-27 09:12:46,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:12:46,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:46,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:12:46,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:12:46,557 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:12:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:12:49,124 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 24 refuted. 2 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-27 09:12:49,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:49,125 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:12:49,125 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:12:49,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:12:49,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:12:49,125 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-27 09:12:49,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 09:12:49,135 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 09:12:49,183 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 09:12:49,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:12:49,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:12:49,265 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 17 treesize of output 14 [2018-10-27 09:12:49,270 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 14 treesize of output 13 [2018-10-27 09:12:49,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:12:49,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:12:49,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 09:12:49,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-10-27 09:12:49,352 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 29 treesize of output 24 [2018-10-27 09:12:49,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 38 [2018-10-27 09:12:49,374 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 09:12:49,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:12:49,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 09:12:49,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:59 [2018-10-27 09:12:50,932 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 31 treesize of output 27 [2018-10-27 09:12:50,939 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:12:50,940 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 27 treesize of output 23 [2018-10-27 09:12:50,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:12:50,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:12:50,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 09:12:50,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:32 [2018-10-27 09:12:55,121 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 09:12:55,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:13:03,964 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-10-27 09:13:06,218 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 32 [2018-10-27 09:13:08,395 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 20 treesize of output 18 [2018-10-27 09:13:08,410 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-10-27 09:13:08,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:13:08,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:13:08,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 09:13:08,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-10-27 09:13:10,643 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 09:13:12,972 WARN L179 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 14 [2018-10-27 09:13:12,981 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 38 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 09:13:13,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:13:13,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15, 15] total 31 [2018-10-27 09:13:13,005 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:13:13,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-27 09:13:13,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 09:13:13,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=818, Unknown=6, NotChecked=0, Total=930 [2018-10-27 09:13:13,007 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 18 states. [2018-10-27 09:13:34,521 WARN L179 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 35 [2018-10-27 09:13:37,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:13:37,887 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-10-27 09:13:37,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 09:13:37,888 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2018-10-27 09:13:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:13:37,890 INFO L225 Difference]: With dead ends: 101 [2018-10-27 09:13:37,890 INFO L226 Difference]: Without dead ends: 73 [2018-10-27 09:13:37,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=160, Invalid=1166, Unknown=6, NotChecked=0, Total=1332 [2018-10-27 09:13:37,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-27 09:13:37,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 60. [2018-10-27 09:13:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-27 09:13:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-10-27 09:13:37,904 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 45 [2018-10-27 09:13:37,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:13:37,904 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-10-27 09:13:37,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-27 09:13:37,905 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-10-27 09:13:37,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-27 09:13:37,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:13:37,906 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:13:37,906 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:13:37,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:13:37,907 INFO L82 PathProgramCache]: Analyzing trace with hash -597350463, now seen corresponding path program 4 times [2018-10-27 09:13:37,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:13:37,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:13:37,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:13:37,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:13:37,908 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:13:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:13:40,174 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 09:13:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 6 proven. 37 refuted. 3 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-27 09:13:42,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:13:42,723 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:13:42,723 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:13:42,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:13:42,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:13:42,723 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-27 09:13:42,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:13:42,731 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:13:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:13:42,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:13:43,383 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 09:13:43,388 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 17 treesize of output 14 [2018-10-27 09:13:43,392 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 14 treesize of output 13 [2018-10-27 09:13:43,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:13:43,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:13:43,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 09:13:43,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-10-27 09:13:43,823 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 29 treesize of output 24 [2018-10-27 09:13:43,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 38 [2018-10-27 09:13:43,846 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-27 09:13:43,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:13:44,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-27 09:13:44,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:59 [2018-10-27 09:13:50,344 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 31 treesize of output 27 [2018-10-27 09:13:50,348 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:13:50,349 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 27 treesize of output 23 [2018-10-27 09:13:50,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:13:50,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:13:50,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 09:13:50,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:32 [2018-10-27 09:13:54,769 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 5 proven. 73 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 09:13:54,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:14:03,548 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-10-27 09:14:08,176 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 56 DAG size of output: 30 [2018-10-27 09:14:10,423 WARN L179 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 32 [2018-10-27 09:14:28,512 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 21 [2018-10-27 09:14:28,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-10-27 09:14:28,534 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:14:28,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-10-27 09:14:28,551 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 09:14:28,554 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:14:28,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 09:14:28,562 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:14:28,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:14:28,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 09:14:28,584 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:48, output treesize:20 [2018-10-27 09:14:30,693 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 09:14:33,659 WARN L179 SmtUtils]: Spent 503.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-27 09:14:39,423 WARN L179 SmtUtils]: Spent 1.95 s on a formula simplification that was a NOOP. DAG size: 14 [2018-10-27 09:14:41,896 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 14 [2018-10-27 09:14:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 09:14:41,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:14:41,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 18] total 38 [2018-10-27 09:14:41,931 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:14:41,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-27 09:14:41,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 09:14:41,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1242, Unknown=17, NotChecked=0, Total=1406 [2018-10-27 09:14:41,935 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 22 states. [2018-10-27 09:15:11,444 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-27 09:15:28,084 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 35 [2018-10-27 09:15:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:15:32,733 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-10-27 09:15:32,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 09:15:32,733 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2018-10-27 09:15:32,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:15:32,734 INFO L225 Difference]: With dead ends: 122 [2018-10-27 09:15:32,734 INFO L226 Difference]: Without dead ends: 85 [2018-10-27 09:15:32,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 80 SyntacticMatches, 9 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 68.5s TimeCoverageRelationStatistics Valid=222, Invalid=1740, Unknown=18, NotChecked=0, Total=1980 [2018-10-27 09:15:32,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-27 09:15:32,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2018-10-27 09:15:32,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-27 09:15:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-10-27 09:15:32,754 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 57 [2018-10-27 09:15:32,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:15:32,754 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-10-27 09:15:32,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-27 09:15:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-10-27 09:15:32,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-27 09:15:32,756 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:15:32,756 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:15:32,756 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:15:32,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:15:32,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1336655223, now seen corresponding path program 5 times [2018-10-27 09:15:32,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:15:32,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:15:32,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:15:32,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:15:32,758 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:15:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:15:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-27 09:15:36,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:15:36,104 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:15:36,104 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:15:36,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:15:36,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:15:36,104 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-27 09:15:36,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:15:36,113 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown