java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 05:03:43,452 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 05:03:43,454 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 05:03:43,466 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 05:03:43,467 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 05:03:43,468 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 05:03:43,470 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 05:03:43,473 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 05:03:43,474 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 05:03:43,476 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 05:03:43,477 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 05:03:43,478 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 05:03:43,479 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 05:03:43,481 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 05:03:43,484 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 05:03:43,485 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 05:03:43,486 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 05:03:43,489 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 05:03:43,496 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 05:03:43,500 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 05:03:43,501 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 05:03:43,505 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 05:03:43,507 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 05:03:43,507 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 05:03:43,507 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 05:03:43,508 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 05:03:43,511 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 05:03:43,512 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 05:03:43,513 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 05:03:43,516 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 05:03:43,516 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 05:03:43,517 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 05:03:43,517 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 05:03:43,517 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 05:03:43,518 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 05:03:43,521 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 05:03:43,521 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 05:03:43,547 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 05:03:43,547 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 05:03:43,548 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 05:03:43,548 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 05:03:43,548 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 05:03:43,550 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 05:03:43,550 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 05:03:43,550 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 05:03:43,550 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 05:03:43,551 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 05:03:43,551 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 05:03:43,551 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 05:03:43,553 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 05:03:43,553 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 05:03:43,553 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 05:03:43,554 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 05:03:43,554 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 05:03:43,554 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 05:03:43,554 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 05:03:43,554 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 05:03:43,555 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 05:03:43,556 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 05:03:43,556 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 05:03:43,556 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 05:03:43,556 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 05:03:43,556 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 05:03:43,557 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 05:03:43,557 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 05:03:43,557 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 05:03:43,557 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 05:03:43,557 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 05:03:43,557 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 05:03:43,558 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 05:03:43,558 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 05:03:43,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 05:03:43,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 05:03:43,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 05:03:43,647 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 05:03:43,648 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 05:03:43,648 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call1_true-termination.i [2018-11-07 05:03:43,709 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6927a1cb/0193e96c20794c81866a40e15d8cd21e/FLAG1ac516879 [2018-11-07 05:03:44,100 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 05:03:44,101 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call1_true-termination.i [2018-11-07 05:03:44,106 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6927a1cb/0193e96c20794c81866a40e15d8cd21e/FLAG1ac516879 [2018-11-07 05:03:44,119 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6927a1cb/0193e96c20794c81866a40e15d8cd21e [2018-11-07 05:03:44,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 05:03:44,130 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 05:03:44,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 05:03:44,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 05:03:44,135 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 05:03:44,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:03:44" (1/1) ... [2018-11-07 05:03:44,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c053053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:44, skipping insertion in model container [2018-11-07 05:03:44,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:03:44" (1/1) ... [2018-11-07 05:03:44,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 05:03:44,172 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 05:03:44,362 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:03:44,366 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 05:03:44,387 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:03:44,407 INFO L193 MainTranslator]: Completed translation [2018-11-07 05:03:44,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:44 WrapperNode [2018-11-07 05:03:44,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 05:03:44,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 05:03:44,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 05:03:44,408 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 05:03:44,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:44" (1/1) ... [2018-11-07 05:03:44,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:44" (1/1) ... [2018-11-07 05:03:44,430 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 05:03:44,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 05:03:44,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 05:03:44,431 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 05:03:44,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:44" (1/1) ... [2018-11-07 05:03:44,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:44" (1/1) ... [2018-11-07 05:03:44,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:44" (1/1) ... [2018-11-07 05:03:44,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:44" (1/1) ... [2018-11-07 05:03:44,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:44" (1/1) ... [2018-11-07 05:03:44,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:44" (1/1) ... [2018-11-07 05:03:44,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:44" (1/1) ... [2018-11-07 05:03:44,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 05:03:44,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 05:03:44,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 05:03:44,458 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 05:03:44,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 05:03:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 05:03:44,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 05:03:44,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 05:03:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 05:03:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 05:03:44,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 05:03:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 05:03:44,584 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 05:03:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 05:03:44,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 05:03:44,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 05:03:44,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 05:03:45,003 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 05:03:45,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:03:45 BoogieIcfgContainer [2018-11-07 05:03:45,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 05:03:45,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 05:03:45,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 05:03:45,008 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 05:03:45,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:03:44" (1/3) ... [2018-11-07 05:03:45,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f2f713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:03:45, skipping insertion in model container [2018-11-07 05:03:45,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:44" (2/3) ... [2018-11-07 05:03:45,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f2f713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:03:45, skipping insertion in model container [2018-11-07 05:03:45,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:03:45" (3/3) ... [2018-11-07 05:03:45,011 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call1_true-termination.i [2018-11-07 05:03:45,021 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 05:03:45,029 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 05:03:45,046 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 05:03:45,085 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 05:03:45,085 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 05:03:45,085 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 05:03:45,085 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 05:03:45,085 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 05:03:45,085 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 05:03:45,086 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 05:03:45,086 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 05:03:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-07 05:03:45,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 05:03:45,110 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:45,111 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:45,113 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:45,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:45,119 INFO L82 PathProgramCache]: Analyzing trace with hash -2044028709, now seen corresponding path program 1 times [2018-11-07 05:03:45,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:45,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:45,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:45,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:45,167 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:45,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:45,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:03:45,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 05:03:45,244 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:03:45,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 05:03:45,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 05:03:45,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 05:03:45,267 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-07 05:03:45,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:45,292 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-07 05:03:45,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 05:03:45,293 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-07 05:03:45,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:45,303 INFO L225 Difference]: With dead ends: 57 [2018-11-07 05:03:45,303 INFO L226 Difference]: Without dead ends: 28 [2018-11-07 05:03:45,306 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 05:03:45,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-07 05:03:45,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-07 05:03:45,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-07 05:03:45,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-07 05:03:45,352 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 17 [2018-11-07 05:03:45,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:45,353 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-07 05:03:45,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 05:03:45,353 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-07 05:03:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 05:03:45,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:45,354 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:45,355 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:45,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:45,355 INFO L82 PathProgramCache]: Analyzing trace with hash -585673780, now seen corresponding path program 1 times [2018-11-07 05:03:45,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:45,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:45,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:45,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:45,358 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:45,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:45,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:03:45,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 05:03:45,480 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:03:45,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 05:03:45,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 05:03:45,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:03:45,483 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 3 states. [2018-11-07 05:03:45,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:45,766 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-07 05:03:45,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 05:03:45,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-07 05:03:45,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:45,769 INFO L225 Difference]: With dead ends: 56 [2018-11-07 05:03:45,769 INFO L226 Difference]: Without dead ends: 39 [2018-11-07 05:03:45,772 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:03:45,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-07 05:03:45,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-11-07 05:03:45,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-07 05:03:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-07 05:03:45,782 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 18 [2018-11-07 05:03:45,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:45,782 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-07 05:03:45,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 05:03:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-07 05:03:45,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 05:03:45,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:45,784 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:45,784 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:45,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:45,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1124826267, now seen corresponding path program 1 times [2018-11-07 05:03:45,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:45,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:45,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:45,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:45,787 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:45,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:45,918 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:45,919 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-11-07 05:03:45,921 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [13], [15], [16], [18], [22], [26], [31], [34], [35], [51], [54], [56], [62], [63], [64], [66] [2018-11-07 05:03:45,968 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:03:45,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:03:46,106 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 05:03:46,397 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 05:03:46,401 INFO L272 AbstractInterpreter]: Visited 21 different actions 85 times. Merged at 5 different actions 53 times. Widened at 1 different actions 7 times. Found 10 fixpoints after 2 different actions. Largest state had 15 variables. [2018-11-07 05:03:46,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:46,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 05:03:46,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:46,430 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:03:46,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:46,443 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:03:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:46,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:03:46,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-07 05:03:46,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-07 05:03:46,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 05:03:46,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:03:46,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:03:46,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-07 05:03:46,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-07 05:03:46,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-07 05:03:46,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 05:03:46,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:03:46,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:03:46,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-07 05:03:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:47,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:03:47,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-11-07 05:03:47,413 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-11-07 05:03:47,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 05:03:47,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:03:47,611 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-11-07 05:03:47,660 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-11-07 05:03:47,675 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 05:03:47,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:03:49,726 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-11-07 05:03:50,010 WARN L179 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-11-07 05:03:50,028 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-11-07 05:03:50,046 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-07 05:03:50,057 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:03:50,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:03:50,065 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:131, output treesize:7 [2018-11-07 05:03:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:50,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:03:50,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 9] total 16 [2018-11-07 05:03:50,117 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:03:50,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 05:03:50,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 05:03:50,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-07 05:03:50,119 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 9 states. [2018-11-07 05:03:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:50,431 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-07 05:03:50,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 05:03:50,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-07 05:03:50,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:50,434 INFO L225 Difference]: With dead ends: 74 [2018-11-07 05:03:50,434 INFO L226 Difference]: Without dead ends: 54 [2018-11-07 05:03:50,437 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-11-07 05:03:50,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-07 05:03:50,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2018-11-07 05:03:50,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 05:03:50,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-11-07 05:03:50,446 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 22 [2018-11-07 05:03:50,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:50,446 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-11-07 05:03:50,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 05:03:50,447 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-11-07 05:03:50,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 05:03:50,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:50,448 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:50,448 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:50,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:50,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2137976925, now seen corresponding path program 1 times [2018-11-07 05:03:50,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:50,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:50,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:50,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:50,450 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 05:03:50,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:50,569 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:50,569 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-07 05:03:50,569 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [13], [15], [16], [18], [22], [26], [31], [34], [35], [37], [39], [40], [44], [51], [54], [56], [59], [61], [62], [63], [64], [66], [67], [68] [2018-11-07 05:03:50,572 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:03:50,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:03:50,585 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 05:03:50,837 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 05:03:50,837 INFO L272 AbstractInterpreter]: Visited 29 different actions 102 times. Merged at 8 different actions 56 times. Widened at 1 different actions 7 times. Found 11 fixpoints after 3 different actions. Largest state had 17 variables. [2018-11-07 05:03:50,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:50,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 05:03:50,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:50,865 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:03:50,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:50,879 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:03:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:50,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:03:50,973 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-07 05:03:50,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 05:03:51,036 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 19 treesize of output 16 [2018-11-07 05:03:51,041 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 16 treesize of output 15 [2018-11-07 05:03:51,042 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 05:03:51,045 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:03:51,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 05:03:51,061 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:103, output treesize:22 [2018-11-07 05:03:51,670 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 25 treesize of output 21 [2018-11-07 05:03:51,697 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 05:03:51,699 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 21 treesize of output 17 [2018-11-07 05:03:51,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 05:03:51,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:03:51,840 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-11-07 05:03:51,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:12 [2018-11-07 05:03:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:52,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:03:56,480 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 30 treesize of output 28 [2018-11-07 05:03:56,503 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 10 treesize of output 6 [2018-11-07 05:03:56,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 05:03:56,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:03:56,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 29 treesize of output 27 [2018-11-07 05:03:56,535 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 18 treesize of output 14 [2018-11-07 05:03:56,538 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 05:03:56,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:03:56,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:03:56,555 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:97, output treesize:7 [2018-11-07 05:03:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:56,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:03:56,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 11] total 23 [2018-11-07 05:03:56,635 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:03:56,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 05:03:56,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 05:03:56,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=430, Unknown=2, NotChecked=0, Total=506 [2018-11-07 05:03:56,637 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 14 states. [2018-11-07 05:03:57,283 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-11-07 05:03:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:57,586 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2018-11-07 05:03:57,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 05:03:57,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-11-07 05:03:57,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:57,594 INFO L225 Difference]: With dead ends: 100 [2018-11-07 05:03:57,594 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 05:03:57,596 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=118, Invalid=636, Unknown=2, NotChecked=0, Total=756 [2018-11-07 05:03:57,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 05:03:57,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2018-11-07 05:03:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-07 05:03:57,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2018-11-07 05:03:57,616 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 37 [2018-11-07 05:03:57,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:57,617 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2018-11-07 05:03:57,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 05:03:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2018-11-07 05:03:57,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-07 05:03:57,620 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:57,620 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:57,620 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:57,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:57,621 INFO L82 PathProgramCache]: Analyzing trace with hash -437771018, now seen corresponding path program 1 times [2018-11-07 05:03:57,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:57,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:57,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:57,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:57,623 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:57,820 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-07 05:03:57,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:57,821 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:57,821 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-11-07 05:03:57,822 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [10], [13], [15], [16], [18], [22], [26], [31], [34], [35], [37], [39], [40], [42], [44], [51], [54], [56], [59], [61], [62], [63], [64], [66], [67], [68], [69] [2018-11-07 05:03:57,824 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:03:57,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:03:57,834 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 05:03:58,454 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 05:03:58,455 INFO L272 AbstractInterpreter]: Visited 31 different actions 335 times. Merged at 16 different actions 157 times. Widened at 2 different actions 14 times. Found 22 fixpoints after 5 different actions. Largest state had 17 variables. [2018-11-07 05:03:58,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:58,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 05:03:58,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:58,491 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:03:58,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:58,500 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:03:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:58,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:03:58,584 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-07 05:03:58,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-07 05:03:58,611 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 19 treesize of output 16 [2018-11-07 05:03:58,617 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 16 treesize of output 15 [2018-11-07 05:03:58,617 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 05:03:58,623 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:03:58,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 05:03:58,649 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:103, output treesize:22 [2018-11-07 05:03:59,373 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 25 treesize of output 21 [2018-11-07 05:03:59,381 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 05:03:59,382 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 21 treesize of output 17 [2018-11-07 05:03:59,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 05:03:59,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:03:59,403 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-11-07 05:03:59,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:12 [2018-11-07 05:03:59,490 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 05:03:59,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:00,162 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 18 [2018-11-07 05:04:01,727 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 47 treesize of output 43 [2018-11-07 05:04:02,004 WARN L179 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 15 [2018-11-07 05:04:02,023 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-11-07 05:04:02,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 05:04:02,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:04:08,220 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 22 treesize of output 20 [2018-11-07 05:04:08,236 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-11-07 05:04:08,243 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 05:04:08,245 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:04:08,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:04:08,248 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:141, output treesize:7 [2018-11-07 05:04:08,333 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 05:04:08,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:08,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 13] total 27 [2018-11-07 05:04:08,353 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:08,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 05:04:08,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 05:04:08,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2018-11-07 05:04:08,355 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 16 states. [2018-11-07 05:04:11,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:11,164 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-11-07 05:04:11,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 05:04:11,164 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-11-07 05:04:11,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:11,166 INFO L225 Difference]: With dead ends: 126 [2018-11-07 05:04:11,167 INFO L226 Difference]: Without dead ends: 84 [2018-11-07 05:04:11,168 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2018-11-07 05:04:11,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-07 05:04:11,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2018-11-07 05:04:11,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-07 05:04:11,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-11-07 05:04:11,181 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 52 [2018-11-07 05:04:11,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:11,181 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-11-07 05:04:11,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 05:04:11,182 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-11-07 05:04:11,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-07 05:04:11,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:11,184 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:11,184 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:11,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:11,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1834499278, now seen corresponding path program 2 times [2018-11-07 05:04:11,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:11,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:11,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:11,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:11,186 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:04:11,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:11,370 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:11,370 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:11,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:11,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:11,371 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:04:11,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:04:11,379 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:04:36,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 05:04:36,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:04:36,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:36,633 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 32 treesize of output 29 [2018-11-07 05:04:36,635 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 16 treesize of output 15 [2018-11-07 05:04:36,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 05:04:36,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:04:36,689 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-07 05:04:36,689 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 05:04:36,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:04:36,715 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:103, output treesize:22 [2018-11-07 05:04:36,758 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 05:04:36,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:41,158 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 36 treesize of output 34 [2018-11-07 05:04:41,187 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 10 treesize of output 6 [2018-11-07 05:04:41,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 05:04:41,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:04:41,193 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 37 treesize of output 35 [2018-11-07 05:04:41,225 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 10 treesize of output 6 [2018-11-07 05:04:41,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 05:04:41,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:04:41,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 05:04:41,244 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:118, output treesize:7 [2018-11-07 05:04:42,715 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 58 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 05:04:42,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:42,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 18] total 25 [2018-11-07 05:04:42,737 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:42,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 05:04:42,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 05:04:42,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2018-11-07 05:04:42,738 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 9 states. [2018-11-07 05:04:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:43,131 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2018-11-07 05:04:43,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 05:04:43,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-11-07 05:04:43,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:43,132 INFO L225 Difference]: With dead ends: 148 [2018-11-07 05:04:43,132 INFO L226 Difference]: Without dead ends: 95 [2018-11-07 05:04:43,134 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2018-11-07 05:04:43,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-07 05:04:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2018-11-07 05:04:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-07 05:04:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-07 05:04:43,148 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 67 [2018-11-07 05:04:43,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:43,148 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-07 05:04:43,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 05:04:43,148 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-07 05:04:43,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-07 05:04:43,149 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:43,150 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:43,150 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:43,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:43,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1873888071, now seen corresponding path program 3 times [2018-11-07 05:04:43,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:43,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:43,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:04:43,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:43,151 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:04:43,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:43,371 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:43,371 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:43,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:43,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:43,371 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:04:43,380 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:04:43,380 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:04:43,432 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:04:43,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:04:43,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:43,541 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 05:04:43,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:46,069 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:04:46,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:46,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 05:04:46,089 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:46,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 05:04:46,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 05:04:46,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:04:46,091 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 8 states. [2018-11-07 05:04:46,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:46,451 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2018-11-07 05:04:46,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:04:46,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2018-11-07 05:04:46,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:46,453 INFO L225 Difference]: With dead ends: 166 [2018-11-07 05:04:46,453 INFO L226 Difference]: Without dead ends: 106 [2018-11-07 05:04:46,454 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:04:46,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-07 05:04:46,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2018-11-07 05:04:46,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-07 05:04:46,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2018-11-07 05:04:46,469 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 71 [2018-11-07 05:04:46,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:46,470 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2018-11-07 05:04:46,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 05:04:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-11-07 05:04:46,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-07 05:04:46,471 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:46,471 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:46,471 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:46,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:46,472 INFO L82 PathProgramCache]: Analyzing trace with hash 121608896, now seen corresponding path program 4 times [2018-11-07 05:04:46,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:46,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:46,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:04:46,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:46,473 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:04:46,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:46,761 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:46,762 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:46,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:46,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:46,762 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:04:46,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:46,778 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:04:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:46,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 05:04:46,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:04:49,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:49,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 05:04:49,386 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:49,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 05:04:49,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 05:04:49,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 05:04:49,388 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 9 states. [2018-11-07 05:04:49,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:49,811 INFO L93 Difference]: Finished difference Result 184 states and 197 transitions. [2018-11-07 05:04:49,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 05:04:49,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2018-11-07 05:04:49,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:49,813 INFO L225 Difference]: With dead ends: 184 [2018-11-07 05:04:49,813 INFO L226 Difference]: Without dead ends: 117 [2018-11-07 05:04:49,813 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 05:04:49,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-07 05:04:49,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2018-11-07 05:04:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-07 05:04:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2018-11-07 05:04:49,830 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 75 [2018-11-07 05:04:49,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:49,830 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2018-11-07 05:04:49,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 05:04:49,830 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-11-07 05:04:49,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-07 05:04:49,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:49,832 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:49,832 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:49,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:49,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1091297977, now seen corresponding path program 5 times [2018-11-07 05:04:49,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:49,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:49,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:49,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:49,834 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:04:50,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:50,376 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:50,376 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:50,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:50,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:50,377 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:04:50,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:04:50,386 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:04:56,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-07 05:04:56,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:04:56,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:56,286 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 05:04:56,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:00,615 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 15 proven. 115 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 05:05:00,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:00,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 23 [2018-11-07 05:05:00,639 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:00,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 05:05:00,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 05:05:00,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2018-11-07 05:05:00,641 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand 10 states. [2018-11-07 05:05:01,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:01,218 INFO L93 Difference]: Finished difference Result 202 states and 217 transitions. [2018-11-07 05:05:01,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 05:05:01,220 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2018-11-07 05:05:01,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:01,221 INFO L225 Difference]: With dead ends: 202 [2018-11-07 05:05:01,221 INFO L226 Difference]: Without dead ends: 128 [2018-11-07 05:05:01,222 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 144 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2018-11-07 05:05:01,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-07 05:05:01,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2018-11-07 05:05:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-07 05:05:01,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-11-07 05:05:01,239 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 79 [2018-11-07 05:05:01,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:01,240 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-11-07 05:05:01,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 05:05:01,240 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-11-07 05:05:01,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-07 05:05:01,242 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:01,242 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:01,242 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:01,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:01,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1408891826, now seen corresponding path program 6 times [2018-11-07 05:05:01,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:01,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:01,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:05:01,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:01,244 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 6 proven. 128 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:05:01,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:01,776 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:01,776 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:01,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:01,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:01,777 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:01,794 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:05:01,794 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:05:01,833 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:05:01,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:05:01,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 05:05:01,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 6 proven. 128 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:05:07,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:07,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-07 05:05:07,434 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:07,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 05:05:07,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 05:05:07,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 05:05:07,435 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 11 states. [2018-11-07 05:05:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:08,158 INFO L93 Difference]: Finished difference Result 220 states and 237 transitions. [2018-11-07 05:05:08,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 05:05:08,159 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-11-07 05:05:08,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:08,160 INFO L225 Difference]: With dead ends: 220 [2018-11-07 05:05:08,160 INFO L226 Difference]: Without dead ends: 139 [2018-11-07 05:05:08,161 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 05:05:08,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-07 05:05:08,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2018-11-07 05:05:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-07 05:05:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-11-07 05:05:08,180 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 83 [2018-11-07 05:05:08,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:08,180 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-11-07 05:05:08,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 05:05:08,180 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-11-07 05:05:08,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-07 05:05:08,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:08,182 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:08,182 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:08,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:08,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1613696981, now seen corresponding path program 7 times [2018-11-07 05:05:08,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:08,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:08,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:05:08,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:08,184 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 6 proven. 162 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:05:08,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:08,811 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:08,812 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:08,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:08,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:08,812 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:08,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:08,821 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:05:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:08,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:08,884 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 05:05:08,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 6 proven. 162 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:05:13,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:13,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 05:05:13,874 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:13,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 05:05:13,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 05:05:13,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 05:05:13,876 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 12 states. [2018-11-07 05:05:14,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:14,785 INFO L93 Difference]: Finished difference Result 238 states and 257 transitions. [2018-11-07 05:05:14,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 05:05:14,786 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2018-11-07 05:05:14,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:14,787 INFO L225 Difference]: With dead ends: 238 [2018-11-07 05:05:14,787 INFO L226 Difference]: Without dead ends: 150 [2018-11-07 05:05:14,789 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 163 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 05:05:14,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-07 05:05:14,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2018-11-07 05:05:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-07 05:05:14,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2018-11-07 05:05:14,804 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 87 [2018-11-07 05:05:14,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:14,804 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2018-11-07 05:05:14,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 05:05:14,804 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-11-07 05:05:14,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-07 05:05:14,806 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:14,806 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:14,806 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:14,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:14,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2051604444, now seen corresponding path program 8 times [2018-11-07 05:05:14,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:14,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:14,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:14,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:14,808 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 6 proven. 200 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:05:15,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:15,478 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:15,478 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:15,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:15,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:15,479 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:15,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:05:15,488 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:05:22,883 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-07 05:05:22,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:05:22,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 05:05:22,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 6 proven. 200 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:05:30,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:30,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 05:05:30,784 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:30,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 05:05:30,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 05:05:30,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 05:05:30,785 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand 13 states. [2018-11-07 05:05:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:32,012 INFO L93 Difference]: Finished difference Result 256 states and 277 transitions. [2018-11-07 05:05:32,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 05:05:32,015 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 91 [2018-11-07 05:05:32,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:32,017 INFO L225 Difference]: With dead ends: 256 [2018-11-07 05:05:32,017 INFO L226 Difference]: Without dead ends: 161 [2018-11-07 05:05:32,018 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 05:05:32,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-07 05:05:32,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2018-11-07 05:05:32,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-07 05:05:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2018-11-07 05:05:32,033 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 91 [2018-11-07 05:05:32,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:32,034 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2018-11-07 05:05:32,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 05:05:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2018-11-07 05:05:32,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-07 05:05:32,035 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:32,036 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:32,036 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:32,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:32,036 INFO L82 PathProgramCache]: Analyzing trace with hash 374183011, now seen corresponding path program 9 times [2018-11-07 05:05:32,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:32,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:32,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:05:32,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:32,037 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 6 proven. 242 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:05:32,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:32,371 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:32,371 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:32,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:32,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:32,371 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:32,380 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:05:32,380 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:05:32,410 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:05:32,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:05:32,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 05:05:32,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 6 proven. 242 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:05:44,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:44,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-07 05:05:44,030 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:44,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 05:05:44,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 05:05:44,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 05:05:44,032 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 14 states. [2018-11-07 05:05:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:45,123 INFO L93 Difference]: Finished difference Result 274 states and 297 transitions. [2018-11-07 05:05:45,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 05:05:45,124 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 95 [2018-11-07 05:05:45,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:45,125 INFO L225 Difference]: With dead ends: 274 [2018-11-07 05:05:45,125 INFO L226 Difference]: Without dead ends: 172 [2018-11-07 05:05:45,126 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 05:05:45,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-07 05:05:45,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 166. [2018-11-07 05:05:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-07 05:05:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 177 transitions. [2018-11-07 05:05:45,141 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 177 transitions. Word has length 95 [2018-11-07 05:05:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:45,142 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 177 transitions. [2018-11-07 05:05:45,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 05:05:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 177 transitions. [2018-11-07 05:05:45,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-07 05:05:45,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:45,143 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:45,143 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:45,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:45,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1029082474, now seen corresponding path program 10 times [2018-11-07 05:05:45,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:45,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:45,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:05:45,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:45,145 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 6 proven. 288 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:05:45,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:45,434 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:45,434 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:45,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:45,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:45,435 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:45,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:45,449 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:05:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:45,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 05:05:45,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 6 proven. 288 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:05:56,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:56,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 05:05:56,847 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:56,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 05:05:56,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 05:05:56,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 05:05:56,848 INFO L87 Difference]: Start difference. First operand 166 states and 177 transitions. Second operand 15 states. [2018-11-07 05:05:57,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:57,990 INFO L93 Difference]: Finished difference Result 292 states and 317 transitions. [2018-11-07 05:05:57,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 05:05:57,993 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 99 [2018-11-07 05:05:57,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:57,994 INFO L225 Difference]: With dead ends: 292 [2018-11-07 05:05:57,994 INFO L226 Difference]: Without dead ends: 183 [2018-11-07 05:05:57,995 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 05:05:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-07 05:05:58,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177. [2018-11-07 05:05:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-07 05:05:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2018-11-07 05:05:58,009 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 99 [2018-11-07 05:05:58,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:58,010 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2018-11-07 05:05:58,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 05:05:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2018-11-07 05:05:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-07 05:05:58,011 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:58,011 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:58,011 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:58,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:58,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1436396273, now seen corresponding path program 11 times [2018-11-07 05:05:58,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:58,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:58,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:58,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:58,013 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 6 proven. 338 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:05:58,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:58,769 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:58,769 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:58,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:05:58,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:58,769 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:05:58,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:05:58,779 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:06:05,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-11-07 05:06:05,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:06:05,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:06:06,014 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 05:06:06,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:06:07,103 WARN L179 SmtUtils]: Spent 1.00 s on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:06:08,168 WARN L179 SmtUtils]: Spent 674.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:06:10,612 WARN L179 SmtUtils]: Spent 671.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:06:13,025 WARN L179 SmtUtils]: Spent 894.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:06:14,463 WARN L179 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:06:16,569 WARN L179 SmtUtils]: Spent 625.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:06:18,328 WARN L179 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:06:19,513 WARN L179 SmtUtils]: Spent 638.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:06:20,910 WARN L179 SmtUtils]: Spent 593.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:06:22,977 WARN L179 SmtUtils]: Spent 641.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-07 05:06:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 6 proven. 338 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:06:23,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:06:23,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 31 [2018-11-07 05:06:23,019 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:06:23,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 05:06:23,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 05:06:23,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2018-11-07 05:06:23,022 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand 16 states. [2018-11-07 05:06:24,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:24,236 INFO L93 Difference]: Finished difference Result 310 states and 337 transitions. [2018-11-07 05:06:24,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 05:06:24,236 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2018-11-07 05:06:24,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:24,237 INFO L225 Difference]: With dead ends: 310 [2018-11-07 05:06:24,238 INFO L226 Difference]: Without dead ends: 194 [2018-11-07 05:06:24,239 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 189 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2018-11-07 05:06:24,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-07 05:06:24,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 188. [2018-11-07 05:06:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-07 05:06:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2018-11-07 05:06:24,256 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 103 [2018-11-07 05:06:24,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:24,256 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2018-11-07 05:06:24,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 05:06:24,257 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2018-11-07 05:06:24,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-07 05:06:24,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:24,258 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:24,258 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:24,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:24,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1837323016, now seen corresponding path program 12 times [2018-11-07 05:06:24,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:24,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:24,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:06:24,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:24,259 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 6 proven. 392 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:06:24,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:24,732 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:06:24,732 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:06:24,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:06:24,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:24,732 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:06:24,740 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:06:24,740 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:06:24,771 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:06:24,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:06:24,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:06:24,819 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 05:06:24,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:06:40,018 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 6 proven. 392 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:06:40,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:06:40,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-11-07 05:06:40,040 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:06:40,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 05:06:40,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 05:06:40,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2018-11-07 05:06:40,041 INFO L87 Difference]: Start difference. First operand 188 states and 201 transitions. Second operand 17 states. [2018-11-07 05:06:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:06:41,369 INFO L93 Difference]: Finished difference Result 328 states and 357 transitions. [2018-11-07 05:06:41,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 05:06:41,370 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 107 [2018-11-07 05:06:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:06:41,371 INFO L225 Difference]: With dead ends: 328 [2018-11-07 05:06:41,371 INFO L226 Difference]: Without dead ends: 205 [2018-11-07 05:06:41,372 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 198 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2018-11-07 05:06:41,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-07 05:06:41,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 199. [2018-11-07 05:06:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-11-07 05:06:41,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 213 transitions. [2018-11-07 05:06:41,390 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 213 transitions. Word has length 107 [2018-11-07 05:06:41,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:06:41,390 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 213 transitions. [2018-11-07 05:06:41,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 05:06:41,390 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 213 transitions. [2018-11-07 05:06:41,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-07 05:06:41,391 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:06:41,391 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:06:41,391 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:06:41,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:06:41,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1684886399, now seen corresponding path program 13 times [2018-11-07 05:06:41,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:06:41,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:41,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:06:41,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:06:41,393 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:06:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 6 proven. 450 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:06:42,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:42,256 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:06:42,256 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:06:42,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:06:42,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:06:42,256 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:06:42,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:06:42,266 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:06:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:06:42,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:06:42,332 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 05:06:42,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:07:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 6 proven. 450 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:07:01,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:07:01,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-07 05:07:01,947 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:07:01,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 05:07:01,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 05:07:01,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 05:07:01,948 INFO L87 Difference]: Start difference. First operand 199 states and 213 transitions. Second operand 18 states. [2018-11-07 05:07:03,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:07:03,961 INFO L93 Difference]: Finished difference Result 346 states and 377 transitions. [2018-11-07 05:07:03,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 05:07:03,961 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 111 [2018-11-07 05:07:03,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:07:03,963 INFO L225 Difference]: With dead ends: 346 [2018-11-07 05:07:03,964 INFO L226 Difference]: Without dead ends: 216 [2018-11-07 05:07:03,965 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 205 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 05:07:03,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-11-07 05:07:03,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2018-11-07 05:07:03,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-07 05:07:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 225 transitions. [2018-11-07 05:07:03,984 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 225 transitions. Word has length 111 [2018-11-07 05:07:03,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:07:03,985 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 225 transitions. [2018-11-07 05:07:03,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 05:07:03,985 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 225 transitions. [2018-11-07 05:07:03,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-07 05:07:03,986 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:07:03,986 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:07:03,986 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:07:03,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:07:03,986 INFO L82 PathProgramCache]: Analyzing trace with hash -385261946, now seen corresponding path program 14 times [2018-11-07 05:07:03,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:07:03,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:03,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:07:03,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:03,987 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:07:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:07:04,366 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 6 proven. 512 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:07:04,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:04,367 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:07:04,367 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:07:04,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:07:04,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:04,367 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:07:04,375 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:07:04,375 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:07:32,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-07 05:07:32,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:07:32,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:07:32,309 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 05:07:32,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:07:52,369 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 6 proven. 512 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:07:52,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:07:52,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-07 05:07:52,393 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:07:52,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 05:07:52,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 05:07:52,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 05:07:52,394 INFO L87 Difference]: Start difference. First operand 210 states and 225 transitions. Second operand 19 states. [2018-11-07 05:07:55,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:07:55,494 INFO L93 Difference]: Finished difference Result 364 states and 397 transitions. [2018-11-07 05:07:55,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 05:07:55,498 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 115 [2018-11-07 05:07:55,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:07:55,499 INFO L225 Difference]: With dead ends: 364 [2018-11-07 05:07:55,500 INFO L226 Difference]: Without dead ends: 227 [2018-11-07 05:07:55,501 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 212 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 05:07:55,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-07 05:07:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 221. [2018-11-07 05:07:55,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-07 05:07:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 237 transitions. [2018-11-07 05:07:55,520 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 237 transitions. Word has length 115 [2018-11-07 05:07:55,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:07:55,521 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 237 transitions. [2018-11-07 05:07:55,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 05:07:55,521 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 237 transitions. [2018-11-07 05:07:55,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 05:07:55,522 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:07:55,522 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:07:55,522 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:07:55,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:07:55,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1527418381, now seen corresponding path program 15 times [2018-11-07 05:07:55,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:07:55,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:55,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:07:55,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:07:55,524 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:07:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:07:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 6 proven. 578 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-07 05:07:55,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:55,924 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:07:55,924 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:07:55,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:07:55,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:07:55,924 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:07:55,932 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:07:55,932 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:07:55,968 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:07:55,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:07:55,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:07:56,017 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-07 05:07:56,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-07 05:08:17,493 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 05:08:17,693 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 05:08:17,694 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 05:08:17,700 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 05:08:17,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:08:17 BoogieIcfgContainer [2018-11-07 05:08:17,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 05:08:17,701 INFO L168 Benchmark]: Toolchain (without parser) took 273572.07 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 935.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -797.8 MB). Peak memory consumption was 138.1 MB. Max. memory is 7.1 GB. [2018-11-07 05:08:17,706 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:08:17,707 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 05:08:17,707 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:08:17,713 INFO L168 Benchmark]: Boogie Preprocessor took 26.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:08:17,713 INFO L168 Benchmark]: RCFGBuilder took 546.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -800.1 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. [2018-11-07 05:08:17,714 INFO L168 Benchmark]: TraceAbstraction took 272695.62 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 183.0 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -8.3 MB). Peak memory consumption was 174.7 MB. Max. memory is 7.1 GB. [2018-11-07 05:08:17,719 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 276.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 21.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 546.34 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 752.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -800.1 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 272695.62 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 183.0 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -8.3 MB). Peak memory consumption was 174.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 11]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 11). Cancelled while BasicCegarLoop was analyzing trace of length 120 with TraceHistMax 18,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 1 error locations. TIMEOUT Result, 272.6s OverallTime, 19 OverallIterations, 18 TraceHistogramMax, 18.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1062 SDtfs, 978 SDslu, 8972 SDs, 0 SdLazy, 15116 SolverSat, 252 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 15.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2774 GetRequests, 2355 SyntacticMatches, 40 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 142.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 102 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 74.1s SatisfiabilityAnalysisTime, 154.4s InterpolantComputationTime, 2623 NumberOfCodeBlocks, 2623 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 3867 ConstructedInterpolants, 51 QuantifiedInterpolants, 1460113 SizeOfPredicates, 60 NumberOfNonLiveVariables, 2288 ConjunctsInSsa, 406 ConjunctsInUnsatCore, 50 InterpolantComputations, 2 PerfectInterpolantSequences, 1709/10767 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown