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-INT-LIM.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_true-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:33:26,788 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:33:26,792 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:33:26,805 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:33:26,806 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:33:26,807 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:33:26,808 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:33:26,809 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:33:26,811 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:33:26,812 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:33:26,813 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:33:26,813 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:33:26,814 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:33:26,815 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:33:26,816 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:33:26,817 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:33:26,817 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:33:26,819 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:33:26,821 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:33:26,822 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:33:26,823 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:33:26,825 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:33:26,827 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:33:26,827 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:33:26,827 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:33:26,828 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:33:26,829 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:33:26,830 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:33:26,831 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:33:26,832 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:33:26,832 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:33:26,833 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:33:26,833 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:33:26,833 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:33:26,834 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:33:26,835 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:33:26,835 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:33:26,850 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:33:26,850 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:33:26,851 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:33:26,851 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:33:26,851 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:33:26,852 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:33:26,852 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:33:26,852 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:33:26,852 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:33:26,852 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:33:26,853 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:33:26,853 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:33:26,853 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:33:26,854 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:33:26,854 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:33:26,854 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:33:26,854 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:33:26,854 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:33:26,854 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:33:26,855 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:33:26,855 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:33:26,855 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:33:26,855 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:33:26,855 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:33:26,856 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:33:26,856 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:33:26,856 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:33:26,856 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:33:26,856 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:33:26,857 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:33:26,857 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:33:26,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:33:26,857 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:33:26,857 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:33:26,858 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:33:26,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:33:26,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:33:26,926 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:33:26,928 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:33:26,928 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:33:26,929 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_true-unreach-call2_true-termination.i [2018-11-12 20:33:26,988 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa90a088/40135839b89a41f0bc8d4095a7b51491/FLAG9beb016f1 [2018-11-12 20:33:27,498 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:33:27,498 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_true-unreach-call2_true-termination.i [2018-11-12 20:33:27,509 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa90a088/40135839b89a41f0bc8d4095a7b51491/FLAG9beb016f1 [2018-11-12 20:33:27,527 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa90a088/40135839b89a41f0bc8d4095a7b51491 [2018-11-12 20:33:27,540 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:33:27,542 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:33:27,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:33:27,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:33:27,553 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:33:27,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:33:27" (1/1) ... [2018-11-12 20:33:27,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ed49cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:33:27, skipping insertion in model container [2018-11-12 20:33:27,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:33:27" (1/1) ... [2018-11-12 20:33:27,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:33:27,593 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:33:27,802 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:33:27,806 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:33:27,834 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:33:27,853 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:33:27,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:33:27 WrapperNode [2018-11-12 20:33:27,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:33:27,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:33:27,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:33:27,855 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:33:27,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:33:27" (1/1) ... [2018-11-12 20:33:27,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:33:27" (1/1) ... [2018-11-12 20:33:27,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:33:27,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:33:27,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:33:27,877 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:33:27,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:33:27" (1/1) ... [2018-11-12 20:33:27,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:33:27" (1/1) ... [2018-11-12 20:33:27,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:33:27" (1/1) ... [2018-11-12 20:33:27,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:33:27" (1/1) ... [2018-11-12 20:33:27,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:33:27" (1/1) ... [2018-11-12 20:33:27,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:33:27" (1/1) ... [2018-11-12 20:33:27,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:33:27" (1/1) ... [2018-11-12 20:33:27,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:33:27,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:33:27,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:33:27,901 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:33:27,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:33:27" (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-12 20:33:28,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-12 20:33:28,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:33:28,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:33:28,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-12 20:33:28,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:33:28,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:33:28,032 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:33:28,032 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:33:28,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-12 20:33:28,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:33:28,033 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:33:28,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-12 20:33:28,365 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:33:28,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:33:28 BoogieIcfgContainer [2018-11-12 20:33:28,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:33:28,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:33:28,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:33:28,378 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:33:28,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:33:27" (1/3) ... [2018-11-12 20:33:28,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24df9a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:33:28, skipping insertion in model container [2018-11-12 20:33:28,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:33:27" (2/3) ... [2018-11-12 20:33:28,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24df9a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:33:28, skipping insertion in model container [2018-11-12 20:33:28,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:33:28" (3/3) ... [2018-11-12 20:33:28,389 INFO L112 eAbstractionObserver]: Analyzing ICFG array_true-unreach-call2_true-termination.i [2018-11-12 20:33:28,398 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:33:28,407 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:33:28,423 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:33:28,456 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:33:28,457 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:33:28,457 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:33:28,457 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:33:28,457 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:33:28,457 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:33:28,457 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:33:28,458 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:33:28,476 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-12 20:33:28,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-12 20:33:28,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:28,482 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:28,484 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:28,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:28,490 INFO L82 PathProgramCache]: Analyzing trace with hash -173834890, now seen corresponding path program 1 times [2018-11-12 20:33:28,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:28,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:28,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:28,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:28,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:28,617 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-12 20:33:28,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:33:28,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:33:28,620 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:33:28,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:33:28,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:33:28,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:33:28,640 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-12 20:33:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:28,662 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-12 20:33:28,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:33:28,663 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-12 20:33:28,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:28,670 INFO L225 Difference]: With dead ends: 35 [2018-11-12 20:33:28,670 INFO L226 Difference]: Without dead ends: 15 [2018-11-12 20:33:28,673 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-12 20:33:28,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-12 20:33:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-12 20:33:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-12 20:33:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-12 20:33:28,707 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-12 20:33:28,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:28,708 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-12 20:33:28,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:33:28,708 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-12 20:33:28,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-12 20:33:28,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:28,709 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:28,709 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:28,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:28,710 INFO L82 PathProgramCache]: Analyzing trace with hash -737648989, now seen corresponding path program 1 times [2018-11-12 20:33:28,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:28,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:28,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:28,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:28,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:28,781 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-12 20:33:28,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:33:28,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-12 20:33:28,782 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:33:28,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:33:28,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:33:28,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:33:28,784 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 3 states. [2018-11-12 20:33:28,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:28,817 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-12 20:33:28,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:33:28,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-12 20:33:28,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:28,818 INFO L225 Difference]: With dead ends: 24 [2018-11-12 20:33:28,819 INFO L226 Difference]: Without dead ends: 18 [2018-11-12 20:33:28,820 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-12 20:33:28,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-12 20:33:28,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-12 20:33:28,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-12 20:33:28,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-12 20:33:28,824 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2018-11-12 20:33:28,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:28,825 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-12 20:33:28,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:33:28,825 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-12 20:33:28,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-12 20:33:28,826 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:28,826 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:28,826 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:28,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:28,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1154592614, now seen corresponding path program 1 times [2018-11-12 20:33:28,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:28,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:28,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:28,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:28,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:28,905 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-12 20:33:28,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:28,905 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:28,909 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-11-12 20:33:28,911 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [27], [29], [35], [36], [37], [39] [2018-11-12 20:33:28,944 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:33:28,945 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:33:29,287 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:33:29,288 INFO L272 AbstractInterpreter]: Visited 15 different actions 35 times. Merged at 3 different actions 15 times. Widened at 1 different actions 1 times. Performed 159 root evaluator evaluations with a maximum evaluation depth of 4. Performed 159 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-11-12 20:33:29,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:29,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:33:29,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:29,338 INFO L192 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-12 20:33:29,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:29,355 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:33:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:29,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:29,462 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-12 20:33:29,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:29,551 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-12 20:33:29,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:29,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-12 20:33:29,580 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:29,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:33:29,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:33:29,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:33:29,582 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 5 states. [2018-11-12 20:33:29,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:29,685 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-12 20:33:29,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:33:29,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-12 20:33:29,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:29,686 INFO L225 Difference]: With dead ends: 27 [2018-11-12 20:33:29,687 INFO L226 Difference]: Without dead ends: 21 [2018-11-12 20:33:29,687 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:33:29,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-12 20:33:29,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-12 20:33:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-12 20:33:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-12 20:33:29,692 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2018-11-12 20:33:29,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:29,692 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-12 20:33:29,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:33:29,695 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-12 20:33:29,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-12 20:33:29,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:29,696 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:29,696 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:29,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:29,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1276704957, now seen corresponding path program 2 times [2018-11-12 20:33:29,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:29,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:29,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:29,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:29,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:29,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:29,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:29,840 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:29,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:29,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:29,841 INFO L192 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-12 20:33:29,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:33:29,859 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:33:29,917 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:33:29,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:29,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:30,015 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:30,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:30,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:30,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-12 20:33:30,174 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:30,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:33:30,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:33:30,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:33:30,175 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 6 states. [2018-11-12 20:33:30,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:30,212 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-12 20:33:30,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:33:30,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-12 20:33:30,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:30,215 INFO L225 Difference]: With dead ends: 30 [2018-11-12 20:33:30,215 INFO L226 Difference]: Without dead ends: 24 [2018-11-12 20:33:30,216 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-12 20:33:30,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-12 20:33:30,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-12 20:33:30,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-12 20:33:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-12 20:33:30,220 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2018-11-12 20:33:30,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:30,221 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-12 20:33:30,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:33:30,221 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-12 20:33:30,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-12 20:33:30,222 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:30,222 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:30,223 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:30,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:30,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1288215558, now seen corresponding path program 3 times [2018-11-12 20:33:30,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:30,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:30,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:30,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:30,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:30,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:30,333 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:30,333 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:30,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:30,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:30,333 INFO L192 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-12 20:33:30,348 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:33:30,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:33:30,394 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:33:30,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:30,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:30,428 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:30,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:30,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:30,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-12 20:33:30,570 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:30,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:33:30,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:33:30,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:33:30,572 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 7 states. [2018-11-12 20:33:30,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:30,626 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-12 20:33:30,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-12 20:33:30,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-12 20:33:30,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:30,629 INFO L225 Difference]: With dead ends: 33 [2018-11-12 20:33:30,629 INFO L226 Difference]: Without dead ends: 27 [2018-11-12 20:33:30,630 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:33:30,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-12 20:33:30,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-12 20:33:30,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-12 20:33:30,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-12 20:33:30,635 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2018-11-12 20:33:30,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:30,635 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-12 20:33:30,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:33:30,635 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-12 20:33:30,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-12 20:33:30,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:30,636 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:30,637 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:30,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:30,637 INFO L82 PathProgramCache]: Analyzing trace with hash -603146269, now seen corresponding path program 4 times [2018-11-12 20:33:30,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:30,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:30,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:30,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:30,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:30,741 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:30,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:30,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:30,742 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:30,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:30,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:30,743 INFO L192 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-12 20:33:30,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:30,753 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:33:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:30,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:30,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:31,221 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:31,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:31,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-12 20:33:31,241 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:31,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:33:31,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:33:31,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:33:31,242 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 8 states. [2018-11-12 20:33:31,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:31,293 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-12 20:33:31,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:33:31,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-12 20:33:31,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:31,296 INFO L225 Difference]: With dead ends: 36 [2018-11-12 20:33:31,296 INFO L226 Difference]: Without dead ends: 30 [2018-11-12 20:33:31,297 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:33:31,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-12 20:33:31,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-12 20:33:31,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-12 20:33:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-12 20:33:31,302 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2018-11-12 20:33:31,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:31,302 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-12 20:33:31,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:33:31,303 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-12 20:33:31,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-12 20:33:31,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:31,304 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:31,304 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:31,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:31,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1388548262, now seen corresponding path program 5 times [2018-11-12 20:33:31,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:31,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:31,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:31,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:31,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:31,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:31,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:31,427 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:31,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:31,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:31,428 INFO L192 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-12 20:33:31,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:33:31,444 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:33:31,492 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-12 20:33:31,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:31,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:31,512 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:31,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:31,658 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:31,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:31,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-12 20:33:31,678 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:31,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:33:31,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:33:31,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:33:31,679 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 9 states. [2018-11-12 20:33:31,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:31,736 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-12 20:33:31,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-12 20:33:31,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-12 20:33:31,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:31,737 INFO L225 Difference]: With dead ends: 39 [2018-11-12 20:33:31,738 INFO L226 Difference]: Without dead ends: 33 [2018-11-12 20:33:31,738 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:33:31,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-12 20:33:31,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-12 20:33:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-12 20:33:31,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-12 20:33:31,743 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 28 [2018-11-12 20:33:31,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:31,743 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-12 20:33:31,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:33:31,744 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-12 20:33:31,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-12 20:33:31,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:31,745 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:31,745 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:31,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:31,745 INFO L82 PathProgramCache]: Analyzing trace with hash -317493117, now seen corresponding path program 6 times [2018-11-12 20:33:31,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:31,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:31,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:31,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:31,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:32,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:32,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:32,022 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:32,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:32,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:32,022 INFO L192 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-12 20:33:32,031 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:33:32,031 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:33:32,059 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:33:32,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:32,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:32,092 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:32,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:32,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:32,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-11-12 20:33:32,382 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:32,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-12 20:33:32,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-12 20:33:32,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:33:32,384 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 10 states. [2018-11-12 20:33:32,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:32,454 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-12 20:33:32,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:33:32,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-12 20:33:32,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:32,455 INFO L225 Difference]: With dead ends: 42 [2018-11-12 20:33:32,455 INFO L226 Difference]: Without dead ends: 36 [2018-11-12 20:33:32,456 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:33:32,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-12 20:33:32,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-12 20:33:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-12 20:33:32,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-11-12 20:33:32,464 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 31 [2018-11-12 20:33:32,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:32,466 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-11-12 20:33:32,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-12 20:33:32,466 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-11-12 20:33:32,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-12 20:33:32,467 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:32,467 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:32,467 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:32,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:32,468 INFO L82 PathProgramCache]: Analyzing trace with hash 174289594, now seen corresponding path program 7 times [2018-11-12 20:33:32,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:32,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:32,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:32,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:32,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:32,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:32,625 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:32,626 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:32,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:32,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:32,626 INFO L192 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-12 20:33:32,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:32,636 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:33:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:32,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:32,773 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:32,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:33,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:33,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-11-12 20:33:33,284 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:33,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 20:33:33,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 20:33:33,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:33:33,285 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 11 states. [2018-11-12 20:33:33,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:33,333 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-11-12 20:33:33,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:33:33,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-11-12 20:33:33,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:33,337 INFO L225 Difference]: With dead ends: 45 [2018-11-12 20:33:33,337 INFO L226 Difference]: Without dead ends: 39 [2018-11-12 20:33:33,338 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-12 20:33:33,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-12 20:33:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-12 20:33:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-12 20:33:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-12 20:33:33,343 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 34 [2018-11-12 20:33:33,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:33,343 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-12 20:33:33,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 20:33:33,344 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-12 20:33:33,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-12 20:33:33,344 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:33,345 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:33,345 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:33,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:33,345 INFO L82 PathProgramCache]: Analyzing trace with hash 739586339, now seen corresponding path program 8 times [2018-11-12 20:33:33,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:33,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:33,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:33,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:33,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:33,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:33,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:33,498 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:33,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:33,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:33,498 INFO L192 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-12 20:33:33,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:33:33,512 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:33:33,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-12 20:33:33,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:33,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:33,608 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:33,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:33,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:33,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-11-12 20:33:33,848 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:33,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-12 20:33:33,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-12 20:33:33,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:33:33,849 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 12 states. [2018-11-12 20:33:33,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:33,974 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-12 20:33:33,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:33:33,979 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-12 20:33:33,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:33,980 INFO L225 Difference]: With dead ends: 48 [2018-11-12 20:33:33,980 INFO L226 Difference]: Without dead ends: 42 [2018-11-12 20:33:33,981 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:33:33,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-12 20:33:33,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-12 20:33:33,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-12 20:33:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-12 20:33:33,987 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 37 [2018-11-12 20:33:33,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:33,987 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-12 20:33:33,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-12 20:33:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-12 20:33:33,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-12 20:33:33,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:33,989 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:33,989 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:33,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:33,990 INFO L82 PathProgramCache]: Analyzing trace with hash 928149018, now seen corresponding path program 9 times [2018-11-12 20:33:33,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:33,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:33,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:33,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:33,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:34,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:34,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:34,161 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:34,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:34,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:34,161 INFO L192 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-12 20:33:34,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:33:34,170 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:33:34,195 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:33:34,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:34,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:34,230 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:34,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:34,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:34,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-11-12 20:33:34,528 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:34,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-12 20:33:34,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-12 20:33:34,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:33:34,530 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 13 states. [2018-11-12 20:33:34,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:34,598 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-12 20:33:34,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-12 20:33:34,598 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-12 20:33:34,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:34,600 INFO L225 Difference]: With dead ends: 51 [2018-11-12 20:33:34,600 INFO L226 Difference]: Without dead ends: 45 [2018-11-12 20:33:34,601 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-12 20:33:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-12 20:33:34,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-12 20:33:34,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-12 20:33:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-12 20:33:34,605 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 40 [2018-11-12 20:33:34,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:34,606 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-12 20:33:34,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-12 20:33:34,606 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-12 20:33:34,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-12 20:33:34,607 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:34,607 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:34,608 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:34,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:34,608 INFO L82 PathProgramCache]: Analyzing trace with hash 581695939, now seen corresponding path program 10 times [2018-11-12 20:33:34,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:34,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:34,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:34,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:34,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:35,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:35,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:35,119 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:35,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:35,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:35,119 INFO L192 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-12 20:33:35,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:35,132 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:33:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:35,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:35,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:35,683 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:35,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:35,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-12 20:33:35,704 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:35,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:33:35,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:33:35,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:33:35,706 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 14 states. [2018-11-12 20:33:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:35,770 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-12 20:33:35,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-12 20:33:35,771 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-11-12 20:33:35,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:35,772 INFO L225 Difference]: With dead ends: 54 [2018-11-12 20:33:35,773 INFO L226 Difference]: Without dead ends: 48 [2018-11-12 20:33:35,774 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-12 20:33:35,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-12 20:33:35,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-12 20:33:35,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-12 20:33:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-11-12 20:33:35,779 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 43 [2018-11-12 20:33:35,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:35,780 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-11-12 20:33:35,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:33:35,780 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-11-12 20:33:35,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-12 20:33:35,781 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:35,781 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:35,781 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:35,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:35,782 INFO L82 PathProgramCache]: Analyzing trace with hash 204431738, now seen corresponding path program 11 times [2018-11-12 20:33:35,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:35,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:35,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:35,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:35,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:36,144 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:36,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:36,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:36,145 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:36,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:36,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:36,145 INFO L192 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-12 20:33:36,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:33:36,154 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:33:36,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-12 20:33:36,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:36,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:36,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:36,653 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:36,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:36,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-11-12 20:33:36,682 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:36,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-12 20:33:36,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-12 20:33:36,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-12 20:33:36,684 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 15 states. [2018-11-12 20:33:36,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:36,754 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-12 20:33:36,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-12 20:33:36,755 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2018-11-12 20:33:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:36,756 INFO L225 Difference]: With dead ends: 57 [2018-11-12 20:33:36,756 INFO L226 Difference]: Without dead ends: 51 [2018-11-12 20:33:36,757 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-12 20:33:36,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-12 20:33:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-12 20:33:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-12 20:33:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-11-12 20:33:36,762 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 46 [2018-11-12 20:33:36,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:36,762 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-11-12 20:33:36,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-12 20:33:36,762 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-12 20:33:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-12 20:33:36,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:36,763 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:36,763 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:36,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:36,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1056033379, now seen corresponding path program 12 times [2018-11-12 20:33:36,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:36,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:36,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:36,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:36,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:37,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:37,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:37,691 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:37,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:37,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:37,692 INFO L192 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-12 20:33:37,700 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:33:37,701 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:33:37,752 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:33:37,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:37,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:37,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:38,266 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:38,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:38,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-11-12 20:33:38,286 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:38,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-12 20:33:38,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-12 20:33:38,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:33:38,287 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 16 states. [2018-11-12 20:33:38,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:38,353 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-11-12 20:33:38,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-12 20:33:38,354 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-11-12 20:33:38,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:38,355 INFO L225 Difference]: With dead ends: 60 [2018-11-12 20:33:38,355 INFO L226 Difference]: Without dead ends: 54 [2018-11-12 20:33:38,356 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-12 20:33:38,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-12 20:33:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-12 20:33:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-12 20:33:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-11-12 20:33:38,362 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 49 [2018-11-12 20:33:38,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:38,362 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-11-12 20:33:38,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-12 20:33:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-11-12 20:33:38,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-12 20:33:38,365 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:38,365 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:38,366 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:38,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:38,366 INFO L82 PathProgramCache]: Analyzing trace with hash 748702938, now seen corresponding path program 13 times [2018-11-12 20:33:38,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:38,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:38,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:38,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:38,367 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:38,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:38,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:38,603 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:38,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:38,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:38,603 INFO L192 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-12 20:33:38,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:38,614 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:33:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:38,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:38,678 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:38,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:39,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:39,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-11-12 20:33:39,249 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:39,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:33:39,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:33:39,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:33:39,251 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 17 states. [2018-11-12 20:33:39,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:39,382 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-12 20:33:39,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-12 20:33:39,383 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 52 [2018-11-12 20:33:39,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:39,384 INFO L225 Difference]: With dead ends: 63 [2018-11-12 20:33:39,384 INFO L226 Difference]: Without dead ends: 57 [2018-11-12 20:33:39,386 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:33:39,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-12 20:33:39,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-12 20:33:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-12 20:33:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-11-12 20:33:39,391 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 52 [2018-11-12 20:33:39,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:39,391 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-11-12 20:33:39,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:33:39,392 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-12 20:33:39,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-12 20:33:39,392 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:39,392 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:39,393 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:39,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:39,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1937810179, now seen corresponding path program 14 times [2018-11-12 20:33:39,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:39,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:39,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:39,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:39,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:39,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:39,732 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:39,732 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:39,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:39,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:39,733 INFO L192 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-12 20:33:39,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:33:39,746 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:33:39,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-12 20:33:39,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:39,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:39,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:40,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:40,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-11-12 20:33:40,616 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:40,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-12 20:33:40,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-12 20:33:40,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:33:40,617 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 18 states. [2018-11-12 20:33:40,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:40,719 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-12 20:33:40,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:33:40,720 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 55 [2018-11-12 20:33:40,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:40,721 INFO L225 Difference]: With dead ends: 66 [2018-11-12 20:33:40,721 INFO L226 Difference]: Without dead ends: 60 [2018-11-12 20:33:40,722 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:33:40,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-12 20:33:40,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-12 20:33:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-12 20:33:40,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-11-12 20:33:40,728 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 55 [2018-11-12 20:33:40,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:40,728 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-11-12 20:33:40,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-12 20:33:40,728 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-11-12 20:33:40,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-12 20:33:40,729 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:40,729 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:40,729 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:40,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:40,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1741369402, now seen corresponding path program 15 times [2018-11-12 20:33:40,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:40,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:40,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:40,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:40,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:41,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:41,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:41,046 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:41,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:41,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:41,046 INFO L192 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-12 20:33:41,056 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:33:41,057 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:33:41,107 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:33:41,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:41,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:41,145 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:41,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:42,010 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:42,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:42,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-11-12 20:33:42,029 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:42,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-12 20:33:42,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-12 20:33:42,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:33:42,030 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 19 states. [2018-11-12 20:33:42,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:42,093 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-11-12 20:33:42,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 20:33:42,097 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-11-12 20:33:42,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:42,098 INFO L225 Difference]: With dead ends: 69 [2018-11-12 20:33:42,098 INFO L226 Difference]: Without dead ends: 63 [2018-11-12 20:33:42,099 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-12 20:33:42,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-12 20:33:42,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-12 20:33:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-12 20:33:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-11-12 20:33:42,104 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 58 [2018-11-12 20:33:42,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:42,105 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-11-12 20:33:42,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-12 20:33:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-11-12 20:33:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-12 20:33:42,107 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:42,107 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:42,107 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:42,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:42,108 INFO L82 PathProgramCache]: Analyzing trace with hash -680361053, now seen corresponding path program 16 times [2018-11-12 20:33:42,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:42,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:42,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:42,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:42,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:42,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:42,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:42,439 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:42,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:42,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:42,439 INFO L192 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-12 20:33:42,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:42,449 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:33:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:42,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:42,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:43,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:43,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-11-12 20:33:43,571 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:43,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 20:33:43,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 20:33:43,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:33:43,572 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 20 states. [2018-11-12 20:33:43,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:43,853 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-12 20:33:43,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-12 20:33:43,853 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-11-12 20:33:43,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:43,854 INFO L225 Difference]: With dead ends: 72 [2018-11-12 20:33:43,854 INFO L226 Difference]: Without dead ends: 66 [2018-11-12 20:33:43,855 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:33:43,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-12 20:33:43,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-12 20:33:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-12 20:33:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-11-12 20:33:43,861 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 61 [2018-11-12 20:33:43,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:43,861 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-11-12 20:33:43,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 20:33:43,861 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-11-12 20:33:43,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-12 20:33:43,862 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:43,862 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:43,862 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:43,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:43,863 INFO L82 PathProgramCache]: Analyzing trace with hash 408292250, now seen corresponding path program 17 times [2018-11-12 20:33:43,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:43,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:43,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:43,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:43,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:44,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:44,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:44,181 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:44,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:44,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:44,182 INFO L192 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-12 20:33:44,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:33:44,192 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:33:44,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-12 20:33:44,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:44,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:44,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:45,427 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:45,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:45,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-11-12 20:33:45,447 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:45,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:33:45,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:33:45,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 20:33:45,449 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 21 states. [2018-11-12 20:33:45,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:45,524 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-11-12 20:33:45,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 20:33:45,525 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-11-12 20:33:45,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:45,526 INFO L225 Difference]: With dead ends: 75 [2018-11-12 20:33:45,526 INFO L226 Difference]: Without dead ends: 69 [2018-11-12 20:33:45,527 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-12 20:33:45,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-12 20:33:45,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-12 20:33:45,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-12 20:33:45,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-11-12 20:33:45,532 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 64 [2018-11-12 20:33:45,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:45,532 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-11-12 20:33:45,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:33:45,532 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-11-12 20:33:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-12 20:33:45,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:45,533 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:45,533 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:45,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:45,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1180789827, now seen corresponding path program 18 times [2018-11-12 20:33:45,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:45,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:45,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:45,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:45,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:46,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:46,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:46,020 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:46,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:46,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:46,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:33:46,029 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:33:46,029 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:33:46,087 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:33:46,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:46,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:46,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:46,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:46,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-11-12 20:33:46,802 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:46,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-12 20:33:46,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-12 20:33:46,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:33:46,803 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 22 states. [2018-11-12 20:33:46,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:46,880 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-12 20:33:46,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-12 20:33:46,881 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-11-12 20:33:46,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:46,882 INFO L225 Difference]: With dead ends: 78 [2018-11-12 20:33:46,882 INFO L226 Difference]: Without dead ends: 72 [2018-11-12 20:33:46,883 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-12 20:33:46,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-12 20:33:46,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-12 20:33:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-12 20:33:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-11-12 20:33:46,888 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 67 [2018-11-12 20:33:46,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:46,888 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-11-12 20:33:46,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-12 20:33:46,888 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-11-12 20:33:46,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-12 20:33:46,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:46,889 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:46,889 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:46,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:46,889 INFO L82 PathProgramCache]: Analyzing trace with hash -2073633030, now seen corresponding path program 19 times [2018-11-12 20:33:46,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:46,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:46,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:46,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:46,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:47,304 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:47,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:47,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:47,305 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:47,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:47,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:47,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:33:47,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:47,316 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:33:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:47,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:47,382 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:47,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:48,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:48,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-11-12 20:33:48,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:48,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 20:33:48,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 20:33:48,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-12 20:33:48,143 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 23 states. [2018-11-12 20:33:48,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:48,254 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-11-12 20:33:48,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 20:33:48,255 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 70 [2018-11-12 20:33:48,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:48,256 INFO L225 Difference]: With dead ends: 81 [2018-11-12 20:33:48,256 INFO L226 Difference]: Without dead ends: 75 [2018-11-12 20:33:48,257 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-12 20:33:48,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-12 20:33:48,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-11-12 20:33:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-12 20:33:48,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-11-12 20:33:48,261 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 70 [2018-11-12 20:33:48,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:48,261 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-11-12 20:33:48,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 20:33:48,262 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-11-12 20:33:48,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-12 20:33:48,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:48,263 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:48,263 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:48,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:48,263 INFO L82 PathProgramCache]: Analyzing trace with hash 6773987, now seen corresponding path program 20 times [2018-11-12 20:33:48,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:48,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:48,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:48,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:48,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:48,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:48,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:48,752 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:48,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:48,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:48,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:33:48,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:33:48,762 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:33:49,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-12 20:33:49,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:49,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:49,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:50,319 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:50,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:50,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-11-12 20:33:50,340 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:50,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 20:33:50,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 20:33:50,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:33:50,342 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 24 states. [2018-11-12 20:33:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:50,563 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-11-12 20:33:50,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-12 20:33:50,566 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2018-11-12 20:33:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:50,567 INFO L225 Difference]: With dead ends: 84 [2018-11-12 20:33:50,567 INFO L226 Difference]: Without dead ends: 78 [2018-11-12 20:33:50,569 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-12 20:33:50,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-12 20:33:50,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-12 20:33:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-12 20:33:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-11-12 20:33:50,572 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 73 [2018-11-12 20:33:50,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:50,572 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-11-12 20:33:50,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 20:33:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-11-12 20:33:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-12 20:33:50,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:50,573 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:50,573 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:50,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:50,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1034136154, now seen corresponding path program 21 times [2018-11-12 20:33:50,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:50,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:50,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:50,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:50,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:50,989 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:50,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:50,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:50,989 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:50,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:50,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:50,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:33:50,997 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:33:50,997 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:33:51,040 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:33:51,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:51,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:51,071 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:51,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:52,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:52,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-11-12 20:33:52,172 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:52,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-12 20:33:52,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-12 20:33:52,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-12 20:33:52,174 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 25 states. [2018-11-12 20:33:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:52,274 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-11-12 20:33:52,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-12 20:33:52,275 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 76 [2018-11-12 20:33:52,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:52,276 INFO L225 Difference]: With dead ends: 87 [2018-11-12 20:33:52,277 INFO L226 Difference]: Without dead ends: 81 [2018-11-12 20:33:52,277 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-12 20:33:52,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-12 20:33:52,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-11-12 20:33:52,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-12 20:33:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-11-12 20:33:52,280 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 76 [2018-11-12 20:33:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:52,280 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-11-12 20:33:52,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-12 20:33:52,280 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-11-12 20:33:52,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-12 20:33:52,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:52,281 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:52,281 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:52,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:52,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1243501955, now seen corresponding path program 22 times [2018-11-12 20:33:52,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:52,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:52,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:52,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:52,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:53,163 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:53,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:53,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:53,163 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:53,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:53,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:53,164 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:33:53,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:53,172 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:33:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:53,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:53,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:54,201 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:54,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:54,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-11-12 20:33:54,220 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:54,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-12 20:33:54,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-12 20:33:54,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:33:54,222 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 26 states. [2018-11-12 20:33:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:54,335 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-11-12 20:33:54,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 20:33:54,335 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-11-12 20:33:54,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:54,337 INFO L225 Difference]: With dead ends: 90 [2018-11-12 20:33:54,337 INFO L226 Difference]: Without dead ends: 84 [2018-11-12 20:33:54,338 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-12 20:33:54,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-12 20:33:54,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-11-12 20:33:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-12 20:33:54,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-11-12 20:33:54,342 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 79 [2018-11-12 20:33:54,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:54,343 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-11-12 20:33:54,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-12 20:33:54,343 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-11-12 20:33:54,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-12 20:33:54,344 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:54,344 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:54,344 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:54,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:54,344 INFO L82 PathProgramCache]: Analyzing trace with hash -2127401542, now seen corresponding path program 23 times [2018-11-12 20:33:54,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:54,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:54,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:33:54,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:54,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:54,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:54,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:54,950 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:54,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:54,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:54,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:33:54,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:33:54,958 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:33:57,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-11-12 20:33:57,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:57,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:57,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:33:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:58,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:33:58,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-11-12 20:33:58,335 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:33:58,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-12 20:33:58,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-12 20:33:58,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-12 20:33:58,337 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 27 states. [2018-11-12 20:33:58,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:33:58,451 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-11-12 20:33:58,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-12 20:33:58,452 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2018-11-12 20:33:58,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:33:58,453 INFO L225 Difference]: With dead ends: 93 [2018-11-12 20:33:58,453 INFO L226 Difference]: Without dead ends: 87 [2018-11-12 20:33:58,454 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-12 20:33:58,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-12 20:33:58,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-11-12 20:33:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-12 20:33:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-11-12 20:33:58,457 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 82 [2018-11-12 20:33:58,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:33:58,457 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-11-12 20:33:58,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-12 20:33:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-11-12 20:33:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-12 20:33:58,458 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:33:58,458 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:33:58,459 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:33:58,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:33:58,459 INFO L82 PathProgramCache]: Analyzing trace with hash 211834403, now seen corresponding path program 24 times [2018-11-12 20:33:58,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:33:58,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:58,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:33:58,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:33:58,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:33:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:33:59,019 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:59,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:59,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:33:59,020 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:33:59,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:33:59,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:33:59,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:33:59,029 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:33:59,029 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:33:59,067 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:33:59,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:33:59,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:33:59,089 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:33:59,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:00,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:00,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-11-12 20:34:00,240 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:00,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-12 20:34:00,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-12 20:34:00,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-12 20:34:00,242 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 28 states. [2018-11-12 20:34:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:00,363 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-11-12 20:34:00,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 20:34:00,365 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 85 [2018-11-12 20:34:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:00,367 INFO L225 Difference]: With dead ends: 96 [2018-11-12 20:34:00,367 INFO L226 Difference]: Without dead ends: 90 [2018-11-12 20:34:00,368 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-12 20:34:00,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-12 20:34:00,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-12 20:34:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-12 20:34:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-11-12 20:34:00,371 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 85 [2018-11-12 20:34:00,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:00,371 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-11-12 20:34:00,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-12 20:34:00,371 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-11-12 20:34:00,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-12 20:34:00,372 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:00,372 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:00,372 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:00,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:00,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1749472998, now seen corresponding path program 25 times [2018-11-12 20:34:00,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:00,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:00,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:34:00,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:00,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:01,094 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:01,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:01,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:01,095 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:01,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:01,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:01,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:01,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:01,103 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:34:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:01,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:01,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:03,387 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:03,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:03,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-11-12 20:34:03,408 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:03,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-12 20:34:03,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-12 20:34:03,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-12 20:34:03,410 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 29 states. [2018-11-12 20:34:03,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:03,509 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-11-12 20:34:03,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 20:34:03,510 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 88 [2018-11-12 20:34:03,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:03,511 INFO L225 Difference]: With dead ends: 99 [2018-11-12 20:34:03,511 INFO L226 Difference]: Without dead ends: 93 [2018-11-12 20:34:03,513 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-12 20:34:03,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-12 20:34:03,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-12 20:34:03,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-12 20:34:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-11-12 20:34:03,516 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 88 [2018-11-12 20:34:03,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:03,517 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-11-12 20:34:03,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-12 20:34:03,517 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-11-12 20:34:03,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-12 20:34:03,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:03,518 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:03,518 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:03,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:03,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1971805891, now seen corresponding path program 26 times [2018-11-12 20:34:03,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:03,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:03,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:03,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:03,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:04,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:04,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:04,076 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:04,076 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:04,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:04,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:04,076 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:04,085 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:34:04,085 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:34:08,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-11-12 20:34:08,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:34:08,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:08,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:08,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:10,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:10,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-11-12 20:34:10,175 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:10,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-12 20:34:10,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-12 20:34:10,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-12 20:34:10,177 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 30 states. [2018-11-12 20:34:10,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:10,284 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-11-12 20:34:10,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 20:34:10,285 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 91 [2018-11-12 20:34:10,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:10,286 INFO L225 Difference]: With dead ends: 102 [2018-11-12 20:34:10,286 INFO L226 Difference]: Without dead ends: 96 [2018-11-12 20:34:10,288 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-12 20:34:10,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-12 20:34:10,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-12 20:34:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-12 20:34:10,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-11-12 20:34:10,291 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 91 [2018-11-12 20:34:10,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:10,291 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-11-12 20:34:10,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-12 20:34:10,291 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-11-12 20:34:10,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-12 20:34:10,292 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:10,292 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:10,292 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:10,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:10,292 INFO L82 PathProgramCache]: Analyzing trace with hash 895343738, now seen corresponding path program 27 times [2018-11-12 20:34:10,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:10,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:10,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:34:10,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:10,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:10,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:10,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:10,878 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:10,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:10,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:10,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:10,888 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:34:10,888 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:34:10,928 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:34:10,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:34:10,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:10,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:12,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:12,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-11-12 20:34:12,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:12,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-12 20:34:12,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-12 20:34:12,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-12 20:34:12,531 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 31 states. [2018-11-12 20:34:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:12,668 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-11-12 20:34:12,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-12 20:34:12,677 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 94 [2018-11-12 20:34:12,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:12,678 INFO L225 Difference]: With dead ends: 105 [2018-11-12 20:34:12,678 INFO L226 Difference]: Without dead ends: 99 [2018-11-12 20:34:12,679 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-11-12 20:34:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-12 20:34:12,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-11-12 20:34:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-12 20:34:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-11-12 20:34:12,683 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 94 [2018-11-12 20:34:12,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:12,683 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-11-12 20:34:12,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-12 20:34:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-11-12 20:34:12,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-12 20:34:12,684 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:12,684 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:12,685 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:12,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:12,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1762824349, now seen corresponding path program 28 times [2018-11-12 20:34:12,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:12,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:12,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:34:12,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:12,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:13,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:13,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:13,385 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:13,386 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:13,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:13,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:13,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:13,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:13,395 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:34:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:13,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:13,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:14,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:14,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:14,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-11-12 20:34:14,975 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:14,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-12 20:34:14,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-12 20:34:14,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-12 20:34:14,977 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 32 states. [2018-11-12 20:34:15,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:15,103 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-11-12 20:34:15,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-12 20:34:15,104 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 97 [2018-11-12 20:34:15,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:15,105 INFO L225 Difference]: With dead ends: 108 [2018-11-12 20:34:15,105 INFO L226 Difference]: Without dead ends: 102 [2018-11-12 20:34:15,106 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-11-12 20:34:15,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-12 20:34:15,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-11-12 20:34:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-12 20:34:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-11-12 20:34:15,110 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 97 [2018-11-12 20:34:15,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:15,110 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-11-12 20:34:15,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-12 20:34:15,110 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-11-12 20:34:15,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-12 20:34:15,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:15,111 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:15,111 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:15,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:15,112 INFO L82 PathProgramCache]: Analyzing trace with hash -641300518, now seen corresponding path program 29 times [2018-11-12 20:34:15,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:15,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:15,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:15,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:15,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:15,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:15,868 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:15,868 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:15,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:15,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:15,868 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:15,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:34:15,877 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:34:21,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-11-12 20:34:21,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:34:21,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:21,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:23,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:23,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-11-12 20:34:23,594 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:23,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-12 20:34:23,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-12 20:34:23,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-12 20:34:23,595 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 33 states. [2018-11-12 20:34:23,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:23,780 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-11-12 20:34:23,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-12 20:34:23,780 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 100 [2018-11-12 20:34:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:23,781 INFO L225 Difference]: With dead ends: 111 [2018-11-12 20:34:23,781 INFO L226 Difference]: Without dead ends: 105 [2018-11-12 20:34:23,782 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-11-12 20:34:23,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-12 20:34:23,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-11-12 20:34:23,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-12 20:34:23,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-11-12 20:34:23,786 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 100 [2018-11-12 20:34:23,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:23,786 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-11-12 20:34:23,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-12 20:34:23,786 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-11-12 20:34:23,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-12 20:34:23,787 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:23,787 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:23,788 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:23,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:23,788 INFO L82 PathProgramCache]: Analyzing trace with hash 124553219, now seen corresponding path program 30 times [2018-11-12 20:34:23,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:23,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:23,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:34:23,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:23,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:24,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:24,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:24,540 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:24,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:24,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:24,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:24,548 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:34:24,548 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:34:24,597 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:34:24,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:34:24,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:24,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:24,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:26,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:26,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-11-12 20:34:26,328 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:26,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-12 20:34:26,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-12 20:34:26,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-11-12 20:34:26,330 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 34 states. [2018-11-12 20:34:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:26,465 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-11-12 20:34:26,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-12 20:34:26,466 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 103 [2018-11-12 20:34:26,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:26,467 INFO L225 Difference]: With dead ends: 114 [2018-11-12 20:34:26,467 INFO L226 Difference]: Without dead ends: 108 [2018-11-12 20:34:26,469 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-11-12 20:34:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-12 20:34:26,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-12 20:34:26,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-12 20:34:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-11-12 20:34:26,473 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 103 [2018-11-12 20:34:26,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:26,474 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-11-12 20:34:26,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-12 20:34:26,474 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-11-12 20:34:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-12 20:34:26,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:26,475 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:26,475 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:26,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:26,475 INFO L82 PathProgramCache]: Analyzing trace with hash 806955834, now seen corresponding path program 31 times [2018-11-12 20:34:26,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:26,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:26,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:34:26,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:26,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:27,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:27,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:27,327 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:27,327 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:27,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:27,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:27,328 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:27,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:27,337 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:34:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:27,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:27,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:27,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:29,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:29,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-11-12 20:34:29,254 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:29,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-12 20:34:29,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-12 20:34:29,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-12 20:34:29,255 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 35 states. [2018-11-12 20:34:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:29,402 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-11-12 20:34:29,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-12 20:34:29,402 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 106 [2018-11-12 20:34:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:29,404 INFO L225 Difference]: With dead ends: 117 [2018-11-12 20:34:29,404 INFO L226 Difference]: Without dead ends: 111 [2018-11-12 20:34:29,405 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-11-12 20:34:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-12 20:34:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-11-12 20:34:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-12 20:34:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-11-12 20:34:29,409 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 106 [2018-11-12 20:34:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:29,410 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-11-12 20:34:29,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-12 20:34:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-11-12 20:34:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-12 20:34:29,411 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:29,411 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:29,411 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:29,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:29,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2111919965, now seen corresponding path program 32 times [2018-11-12 20:34:29,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:29,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:29,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:29,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:29,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:30,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:30,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:30,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:30,160 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:30,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:30,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:30,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:30,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:34:30,168 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:34:42,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-11-12 20:34:42,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:34:42,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:42,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:44,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:44,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-11-12 20:34:44,799 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:44,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-12 20:34:44,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-12 20:34:44,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-12 20:34:44,801 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 36 states. [2018-11-12 20:34:44,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:44,942 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-11-12 20:34:44,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-12 20:34:44,942 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 109 [2018-11-12 20:34:44,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:44,944 INFO L225 Difference]: With dead ends: 120 [2018-11-12 20:34:44,944 INFO L226 Difference]: Without dead ends: 114 [2018-11-12 20:34:44,945 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-11-12 20:34:44,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-12 20:34:44,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-11-12 20:34:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-12 20:34:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-11-12 20:34:44,950 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 109 [2018-11-12 20:34:44,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:44,951 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-11-12 20:34:44,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-12 20:34:44,951 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-11-12 20:34:44,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-12 20:34:44,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:44,952 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:44,952 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:44,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:44,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1861994138, now seen corresponding path program 33 times [2018-11-12 20:34:44,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:44,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:44,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:34:44,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:44,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:45,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:45,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:45,835 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:45,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:45,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:45,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:45,843 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:34:45,843 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:34:45,890 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:34:45,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:34:45,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:46,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:46,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:49,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:49,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-11-12 20:34:49,059 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:49,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-12 20:34:49,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-12 20:34:49,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-11-12 20:34:49,060 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 37 states. [2018-11-12 20:34:49,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:49,204 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-11-12 20:34:49,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-12 20:34:49,204 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 112 [2018-11-12 20:34:49,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:49,205 INFO L225 Difference]: With dead ends: 123 [2018-11-12 20:34:49,205 INFO L226 Difference]: Without dead ends: 117 [2018-11-12 20:34:49,205 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-11-12 20:34:49,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-12 20:34:49,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-11-12 20:34:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-12 20:34:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-11-12 20:34:49,208 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 112 [2018-11-12 20:34:49,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:49,209 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-11-12 20:34:49,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-12 20:34:49,209 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-11-12 20:34:49,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-12 20:34:49,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:49,210 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:49,210 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:49,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:49,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2036477629, now seen corresponding path program 34 times [2018-11-12 20:34:49,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:49,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:49,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:34:49,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:49,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:50,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:50,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:50,044 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:50,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:50,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:50,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:50,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:50,052 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:34:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:50,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:34:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:50,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:34:52,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:52,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:34:52,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-11-12 20:34:52,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:34:52,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-12 20:34:52,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-12 20:34:52,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-12 20:34:52,607 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 38 states. [2018-11-12 20:34:52,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:34:52,748 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-11-12 20:34:52,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-12 20:34:52,751 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 115 [2018-11-12 20:34:52,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:34:52,752 INFO L225 Difference]: With dead ends: 126 [2018-11-12 20:34:52,752 INFO L226 Difference]: Without dead ends: 120 [2018-11-12 20:34:52,753 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-11-12 20:34:52,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-12 20:34:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-11-12 20:34:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-12 20:34:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-11-12 20:34:52,756 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 115 [2018-11-12 20:34:52,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:34:52,756 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-11-12 20:34:52,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-12 20:34:52,757 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-11-12 20:34:52,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-12 20:34:52,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:34:52,757 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:34:52,758 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:34:52,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:34:52,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1198237190, now seen corresponding path program 35 times [2018-11-12 20:34:52,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:34:52,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:52,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:34:52,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:34:52,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:34:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:34:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:34:54,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:54,635 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:34:54,635 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:34:54,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:34:54,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:34:54,636 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:34:54,644 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:34:54,644 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:35:11,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-12 20:35:11,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:11,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:11,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:11,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:14,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:14,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-11-12 20:35:14,236 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:14,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-12 20:35:14,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-12 20:35:14,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-12 20:35:14,238 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 39 states. [2018-11-12 20:35:14,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:14,373 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-11-12 20:35:14,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-12 20:35:14,374 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 118 [2018-11-12 20:35:14,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:14,375 INFO L225 Difference]: With dead ends: 129 [2018-11-12 20:35:14,375 INFO L226 Difference]: Without dead ends: 123 [2018-11-12 20:35:14,376 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-11-12 20:35:14,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-12 20:35:14,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-11-12 20:35:14,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-12 20:35:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-11-12 20:35:14,378 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 118 [2018-11-12 20:35:14,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:14,379 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-11-12 20:35:14,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-12 20:35:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-11-12 20:35:14,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-12 20:35:14,380 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:14,380 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:14,380 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:14,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:14,381 INFO L82 PathProgramCache]: Analyzing trace with hash -117177885, now seen corresponding path program 36 times [2018-11-12 20:35:14,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:14,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:14,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:14,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:14,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:15,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:15,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:15,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:15,714 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:15,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:15,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:15,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:15,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:35:15,722 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:35:15,785 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:35:15,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:15,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:15,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:18,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:18,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:18,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-11-12 20:35:18,779 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:18,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-12 20:35:18,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-12 20:35:18,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-11-12 20:35:18,780 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 40 states. [2018-11-12 20:35:19,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:19,299 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-11-12 20:35:19,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-12 20:35:19,302 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 121 [2018-11-12 20:35:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:19,303 INFO L225 Difference]: With dead ends: 132 [2018-11-12 20:35:19,303 INFO L226 Difference]: Without dead ends: 126 [2018-11-12 20:35:19,304 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-11-12 20:35:19,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-12 20:35:19,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-12 20:35:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-12 20:35:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-11-12 20:35:19,309 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 121 [2018-11-12 20:35:19,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:19,309 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-11-12 20:35:19,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-12 20:35:19,310 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-11-12 20:35:19,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-12 20:35:19,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:19,311 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:19,311 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:19,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:19,311 INFO L82 PathProgramCache]: Analyzing trace with hash 2055791962, now seen corresponding path program 37 times [2018-11-12 20:35:19,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:19,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:19,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:19,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:19,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:20,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:20,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:20,988 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:20,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:20,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:20,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:20,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:20,998 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:35:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:21,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:21,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:23,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:23,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:23,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-11-12 20:35:23,943 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:23,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-12 20:35:23,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-12 20:35:23,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-12 20:35:23,944 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 41 states. [2018-11-12 20:35:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:24,128 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-11-12 20:35:24,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-12 20:35:24,129 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 124 [2018-11-12 20:35:24,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:24,131 INFO L225 Difference]: With dead ends: 135 [2018-11-12 20:35:24,131 INFO L226 Difference]: Without dead ends: 129 [2018-11-12 20:35:24,132 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-11-12 20:35:24,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-12 20:35:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-11-12 20:35:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-12 20:35:24,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-11-12 20:35:24,135 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 124 [2018-11-12 20:35:24,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:24,136 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-11-12 20:35:24,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-12 20:35:24,136 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-11-12 20:35:24,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-12 20:35:24,137 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:24,137 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:24,137 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:24,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:24,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1041548669, now seen corresponding path program 38 times [2018-11-12 20:35:24,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:24,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:24,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:24,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:24,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:25,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:25,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:25,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:25,230 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:25,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:25,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:25,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:25,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:35:25,245 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:35:47,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-11-12 20:35:47,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:47,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:47,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:47,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:50,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:50,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-11-12 20:35:50,950 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:50,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-12 20:35:50,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-12 20:35:50,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-12 20:35:50,952 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 42 states. [2018-11-12 20:35:51,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:51,158 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-11-12 20:35:51,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-12 20:35:51,159 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 127 [2018-11-12 20:35:51,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:51,160 INFO L225 Difference]: With dead ends: 138 [2018-11-12 20:35:51,160 INFO L226 Difference]: Without dead ends: 132 [2018-11-12 20:35:51,161 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-11-12 20:35:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-12 20:35:51,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-11-12 20:35:51,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-12 20:35:51,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-11-12 20:35:51,165 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 127 [2018-11-12 20:35:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:51,166 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-11-12 20:35:51,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-12 20:35:51,166 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-11-12 20:35:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-12 20:35:51,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:51,167 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:51,167 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:51,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:51,167 INFO L82 PathProgramCache]: Analyzing trace with hash -838899526, now seen corresponding path program 39 times [2018-11-12 20:35:51,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:51,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:51,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:51,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:51,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:52,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:52,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:52,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:52,366 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:52,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:52,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:52,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:52,374 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:35:52,375 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:35:52,435 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:35:52,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:35:52,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:52,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:35:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:55,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:35:55,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-11-12 20:35:55,556 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:35:55,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-12 20:35:55,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-12 20:35:55,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-11-12 20:35:55,558 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 43 states. [2018-11-12 20:35:55,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:35:55,783 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-11-12 20:35:55,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-12 20:35:55,783 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 130 [2018-11-12 20:35:55,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:35:55,785 INFO L225 Difference]: With dead ends: 141 [2018-11-12 20:35:55,785 INFO L226 Difference]: Without dead ends: 135 [2018-11-12 20:35:55,785 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-11-12 20:35:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-12 20:35:55,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-11-12 20:35:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-12 20:35:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-11-12 20:35:55,790 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 130 [2018-11-12 20:35:55,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:35:55,791 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-11-12 20:35:55,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-12 20:35:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-11-12 20:35:55,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-12 20:35:55,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:35:55,792 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:35:55,792 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:35:55,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:35:55,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1852668707, now seen corresponding path program 40 times [2018-11-12 20:35:55,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:35:55,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:55,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:35:55,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:35:55,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:35:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:57,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:57,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:35:57,007 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:35:57,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:35:57,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:35:57,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:35:57,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:35:57,017 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:35:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:35:57,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:35:57,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:35:57,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:36:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:00,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:36:00,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-11-12 20:36:00,282 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:36:00,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-12 20:36:00,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-12 20:36:00,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-12 20:36:00,284 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 44 states. [2018-11-12 20:36:00,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:36:00,473 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-11-12 20:36:00,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-12 20:36:00,474 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 133 [2018-11-12 20:36:00,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:36:00,475 INFO L225 Difference]: With dead ends: 144 [2018-11-12 20:36:00,475 INFO L226 Difference]: Without dead ends: 138 [2018-11-12 20:36:00,476 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-11-12 20:36:00,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-12 20:36:00,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-11-12 20:36:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-12 20:36:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-11-12 20:36:00,481 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 133 [2018-11-12 20:36:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:36:00,481 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-11-12 20:36:00,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-12 20:36:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-11-12 20:36:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-12 20:36:00,482 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:36:00,483 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:36:00,483 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:36:00,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:36:00,483 INFO L82 PathProgramCache]: Analyzing trace with hash -677518310, now seen corresponding path program 41 times [2018-11-12 20:36:00,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:36:00,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:00,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:36:00,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:36:00,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:36:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:36:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:36:01,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:01,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:36:01,641 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:36:01,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:36:01,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:36:01,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:36:01,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:36:01,649 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:37:02,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-11-12 20:37:02,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:37:02,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:37:02,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:02,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:37:05,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:05,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:37:05,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-11-12 20:37:05,627 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:37:05,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-12 20:37:05,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-12 20:37:05,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-12 20:37:05,628 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 45 states. [2018-11-12 20:37:05,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:37:05,834 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-11-12 20:37:05,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-12 20:37:05,835 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 136 [2018-11-12 20:37:05,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:37:05,836 INFO L225 Difference]: With dead ends: 147 [2018-11-12 20:37:05,836 INFO L226 Difference]: Without dead ends: 141 [2018-11-12 20:37:05,837 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-11-12 20:37:05,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-12 20:37:05,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2018-11-12 20:37:05,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-12 20:37:05,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-11-12 20:37:05,840 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 136 [2018-11-12 20:37:05,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:37:05,841 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-11-12 20:37:05,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-12 20:37:05,841 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-11-12 20:37:05,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-12 20:37:05,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:37:05,842 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:37:05,842 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:37:05,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:37:05,842 INFO L82 PathProgramCache]: Analyzing trace with hash -802896957, now seen corresponding path program 42 times [2018-11-12 20:37:05,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:37:05,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:05,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:37:05,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:05,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:37:05,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:37:07,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:07,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:07,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:37:07,194 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:37:07,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:37:07,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:07,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:37:07,204 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:37:07,204 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:37:07,266 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:37:07,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:37:07,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:37:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:07,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:37:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:10,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:37:10,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-11-12 20:37:10,897 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:37:10,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-12 20:37:10,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-12 20:37:10,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-11-12 20:37:10,898 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 46 states. [2018-11-12 20:37:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:37:11,085 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-11-12 20:37:11,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-12 20:37:11,085 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 139 [2018-11-12 20:37:11,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:37:11,087 INFO L225 Difference]: With dead ends: 150 [2018-11-12 20:37:11,087 INFO L226 Difference]: Without dead ends: 144 [2018-11-12 20:37:11,087 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-11-12 20:37:11,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-12 20:37:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-11-12 20:37:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-12 20:37:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-11-12 20:37:11,091 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 139 [2018-11-12 20:37:11,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:37:11,092 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-11-12 20:37:11,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-12 20:37:11,092 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-11-12 20:37:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-12 20:37:11,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:37:11,092 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:37:11,093 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:37:11,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:37:11,093 INFO L82 PathProgramCache]: Analyzing trace with hash 663377786, now seen corresponding path program 43 times [2018-11-12 20:37:11,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:37:11,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:11,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:37:11,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:11,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:37:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:37:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:12,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:12,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:37:12,583 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:37:12,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:37:12,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:12,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:37:12,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:37:12,596 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:37:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:37:12,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:37:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:12,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:37:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:16,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:37:16,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-11-12 20:37:16,235 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:37:16,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-12 20:37:16,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-12 20:37:16,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-12 20:37:16,236 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 47 states. [2018-11-12 20:37:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:37:16,413 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-11-12 20:37:16,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-12 20:37:16,413 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 142 [2018-11-12 20:37:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:37:16,414 INFO L225 Difference]: With dead ends: 153 [2018-11-12 20:37:16,414 INFO L226 Difference]: Without dead ends: 147 [2018-11-12 20:37:16,415 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-11-12 20:37:16,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-12 20:37:16,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-11-12 20:37:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-12 20:37:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-11-12 20:37:16,419 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 142 [2018-11-12 20:37:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:37:16,419 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-11-12 20:37:16,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-12 20:37:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-11-12 20:37:16,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-12 20:37:16,420 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:37:16,420 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:37:16,420 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:37:16,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:37:16,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1658121117, now seen corresponding path program 44 times [2018-11-12 20:37:16,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:37:16,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:16,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:37:16,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:37:16,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:37:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:37:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:37:17,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:17,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:37:17,788 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:37:17,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:37:17,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:37:17,789 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:37:17,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:37:17,797 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown